./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:57:16,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:57:16,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:57:16,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:57:16,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:57:16,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:57:16,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:57:16,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:57:16,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:57:16,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:57:16,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:57:16,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:57:16,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:57:16,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:57:16,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:57:16,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:57:16,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:57:16,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:57:16,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:57:16,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:57:16,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:57:16,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:57:16,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:57:16,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:57:16,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:57:16,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:57:16,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:57:16,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:57:16,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:57:16,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:57:16,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:57:16,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:57:16,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:57:16,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:57:16,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:57:16,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:57:16,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:57:16,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:57:16,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:57:16,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:57:16,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:57:16,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:57:16,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:57:16,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:57:16,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:57:16,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:57:16,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:57:16,728 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:57:16,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:57:16,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:57:16,730 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:57:16,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:57:16,730 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:57:16,731 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:57:16,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:57:16,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:57:16,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:57:16,732 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:57:16,732 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:57:16,733 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:57:16,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:57:16,733 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:57:16,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:57:16,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:57:16,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:57:16,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:57:16,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:57:16,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:57:16,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:57:16,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:57:16,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:57:16,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:57:16,736 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2022-11-21 13:57:17,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:57:17,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:57:17,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:57:17,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:57:17,173 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:57:17,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-11-21 13:57:20,930 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:57:21,206 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:57:21,207 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-11-21 13:57:21,234 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data/c1c6ab7df/d64e554010c34cfdb8f8de42f8adb5b7/FLAG6c5819345 [2022-11-21 13:57:21,249 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data/c1c6ab7df/d64e554010c34cfdb8f8de42f8adb5b7 [2022-11-21 13:57:21,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:57:21,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:57:21,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:57:21,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:57:21,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:57:21,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:57:21" (1/1) ... [2022-11-21 13:57:21,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d43d5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:21, skipping insertion in model container [2022-11-21 13:57:21,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:57:21" (1/1) ... [2022-11-21 13:57:21,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:57:21,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:57:21,509 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-11-21 13:57:21,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:57:21,907 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:57:21,925 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-11-21 13:57:22,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:57:22,071 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:57:22,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22 WrapperNode [2022-11-21 13:57:22,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:57:22,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:57:22,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:57:22,076 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:57:22,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,172 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-11-21 13:57:22,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:57:22,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:57:22,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:57:22,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:57:22,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,236 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:57:22,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:57:22,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:57:22,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:57:22,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (1/1) ... [2022-11-21 13:57:22,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:57:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:22,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:57:22,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:57:22,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:57:22,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:57:22,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:57:22,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:57:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:57:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:57:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:57:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:57:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:57:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:57:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:57:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:57:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-21 13:57:22,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-21 13:57:22,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:57:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:57:22,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:57:22,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:57:22,356 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:57:22,519 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:57:22,521 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:57:23,319 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:57:24,000 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:57:24,001 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:57:24,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:57:24 BoogieIcfgContainer [2022-11-21 13:57:24,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:57:24,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:57:24,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:57:24,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:57:24,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:57:21" (1/3) ... [2022-11-21 13:57:24,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdf2610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:57:24, skipping insertion in model container [2022-11-21 13:57:24,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:57:22" (2/3) ... [2022-11-21 13:57:24,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdf2610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:57:24, skipping insertion in model container [2022-11-21 13:57:24,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:57:24" (3/3) ... [2022-11-21 13:57:24,017 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-11-21 13:57:24,039 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:57:24,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-11-21 13:57:24,040 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:57:24,251 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:57:24,289 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:57:24,316 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 211 transitions, 442 flow [2022-11-21 13:57:24,322 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 211 transitions, 442 flow [2022-11-21 13:57:24,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 211 transitions, 442 flow [2022-11-21 13:57:24,476 INFO L130 PetriNetUnfolder]: 2/207 cut-off events. [2022-11-21 13:57:24,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:57:24,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 2/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 327 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2022-11-21 13:57:24,493 INFO L119 LiptonReduction]: Number of co-enabled transitions 10744 [2022-11-21 13:58:13,625 INFO L134 LiptonReduction]: Checked pairs total: 52253 [2022-11-21 13:58:13,626 INFO L136 LiptonReduction]: Total number of compositions: 203 [2022-11-21 13:58:13,637 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 93 transitions, 206 flow [2022-11-21 13:58:34,188 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:34,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:58:34,260 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;@36be14b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:58:34,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2022-11-21 13:58:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:58:35,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:35,107 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:58:35,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:58:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1364, now seen corresponding path program 1 times [2022-11-21 13:58:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:35,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233566624] [2022-11-21 13:58:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:35,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:35,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233566624] [2022-11-21 13:58:35,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233566624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:35,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:35,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:58:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501258935] [2022-11-21 13:58:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:35,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:58:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:58:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:58:36,307 INFO L87 Difference]: Start difference. First operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:40,455 INFO L93 Difference]: Finished difference Result 77980 states and 344739 transitions. [2022-11-21 13:58:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:58:40,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 13:58:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:41,630 INFO L225 Difference]: With dead ends: 77980 [2022-11-21 13:58:41,630 INFO L226 Difference]: Without dead ends: 77980 [2022-11-21 13:58:41,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:58:41,635 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:41,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77980 states. [2022-11-21 13:58:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77980 to 77980. [2022-11-21 13:58:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77980 states, 72311 states have (on average 4.767448935846551) internal successors, (344739), 77979 states have internal predecessors, (344739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77980 states to 77980 states and 344739 transitions. [2022-11-21 13:58:47,415 INFO L78 Accepts]: Start accepts. Automaton has 77980 states and 344739 transitions. Word has length 1 [2022-11-21 13:58:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:47,415 INFO L495 AbstractCegarLoop]: Abstraction has 77980 states and 344739 transitions. [2022-11-21 13:58:47,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 77980 states and 344739 transitions. [2022-11-21 13:58:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:58:47,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:47,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:58:47,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:58:47,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:58:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash 41822169, now seen corresponding path program 1 times [2022-11-21 13:58:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67091224] [2022-11-21 13:58:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:48,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67091224] [2022-11-21 13:58:48,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67091224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:48,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:48,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156473931] [2022-11-21 13:58:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:48,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:48,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:48,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:48,608 INFO L87 Difference]: Start difference. First operand 77980 states and 344739 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:49,863 INFO L93 Difference]: Finished difference Result 59370 states and 238107 transitions. [2022-11-21 13:58:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 13:58:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:50,479 INFO L225 Difference]: With dead ends: 59370 [2022-11-21 13:58:50,480 INFO L226 Difference]: Without dead ends: 59370 [2022-11-21 13:58:50,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:50,484 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:50,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:58:50,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59370 states. [2022-11-21 13:58:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59370 to 53466. [2022-11-21 13:58:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53466 states, 51727 states have (on average 4.423589228062714) internal successors, (228819), 53465 states have internal predecessors, (228819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53466 states to 53466 states and 228819 transitions. [2022-11-21 13:58:54,467 INFO L78 Accepts]: Start accepts. Automaton has 53466 states and 228819 transitions. Word has length 4 [2022-11-21 13:58:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:54,467 INFO L495 AbstractCegarLoop]: Abstraction has 53466 states and 228819 transitions. [2022-11-21 13:58:54,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53466 states and 228819 transitions. [2022-11-21 13:58:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 13:58:54,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:54,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 13:58:54,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:58:54,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:58:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash 41822170, now seen corresponding path program 1 times [2022-11-21 13:58:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:54,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756647636] [2022-11-21 13:58:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:54,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 13:58:54,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:54,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756647636] [2022-11-21 13:58:54,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756647636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:54,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:54,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783503234] [2022-11-21 13:58:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:54,844 INFO L87 Difference]: Start difference. First operand 53466 states and 228819 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:55,165 INFO L93 Difference]: Finished difference Result 17348 states and 66516 transitions. [2022-11-21 13:58:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:55,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 13:58:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:55,305 INFO L225 Difference]: With dead ends: 17348 [2022-11-21 13:58:55,305 INFO L226 Difference]: Without dead ends: 17128 [2022-11-21 13:58:55,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:55,307 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:55,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17128 states. [2022-11-21 13:58:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17128 to 17128. [2022-11-21 13:58:55,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17128 states, 16931 states have (on average 3.8712421002894097) internal successors, (65544), 17127 states have internal predecessors, (65544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17128 states to 17128 states and 65544 transitions. [2022-11-21 13:58:55,942 INFO L78 Accepts]: Start accepts. Automaton has 17128 states and 65544 transitions. Word has length 4 [2022-11-21 13:58:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:55,942 INFO L495 AbstractCegarLoop]: Abstraction has 17128 states and 65544 transitions. [2022-11-21 13:58:55,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 17128 states and 65544 transitions. [2022-11-21 13:58:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:58:55,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:55,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:58:55,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:58:55,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:58:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1536461845, now seen corresponding path program 1 times [2022-11-21 13:58:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:55,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902444061] [2022-11-21 13:58:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:56,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902444061] [2022-11-21 13:58:56,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902444061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:56,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:56,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:56,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036784382] [2022-11-21 13:58:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:56,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:56,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:56,163 INFO L87 Difference]: Start difference. First operand 17128 states and 65544 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:56,544 INFO L93 Difference]: Finished difference Result 14606 states and 54863 transitions. [2022-11-21 13:58:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:56,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-21 13:58:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:56,637 INFO L225 Difference]: With dead ends: 14606 [2022-11-21 13:58:56,637 INFO L226 Difference]: Without dead ends: 14530 [2022-11-21 13:58:56,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:56,639 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:56,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:58:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14530 states. [2022-11-21 13:58:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14530 to 14530. [2022-11-21 13:58:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14530 states, 14384 states have (on average 3.797205228031146) internal successors, (54619), 14529 states have internal predecessors, (54619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14530 states to 14530 states and 54619 transitions. [2022-11-21 13:58:57,758 INFO L78 Accepts]: Start accepts. Automaton has 14530 states and 54619 transitions. Word has length 6 [2022-11-21 13:58:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:57,758 INFO L495 AbstractCegarLoop]: Abstraction has 14530 states and 54619 transitions. [2022-11-21 13:58:57,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14530 states and 54619 transitions. [2022-11-21 13:58:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:58:57,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:57,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:57,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:58:57,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:58:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1598342468, now seen corresponding path program 1 times [2022-11-21 13:58:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:57,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123207289] [2022-11-21 13:58:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:57,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123207289] [2022-11-21 13:58:57,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123207289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:57,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:57,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880543746] [2022-11-21 13:58:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:57,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:57,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:57,982 INFO L87 Difference]: Start difference. First operand 14530 states and 54619 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:58,328 INFO L93 Difference]: Finished difference Result 14402 states and 54075 transitions. [2022-11-21 13:58:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:58:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:58,388 INFO L225 Difference]: With dead ends: 14402 [2022-11-21 13:58:58,388 INFO L226 Difference]: Without dead ends: 14402 [2022-11-21 13:58:58,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:58,389 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:58,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14402 states. [2022-11-21 13:58:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14402 to 14402. [2022-11-21 13:58:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14402 states, 14256 states have (on average 3.7931397306397305) internal successors, (54075), 14401 states have internal predecessors, (54075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 54075 transitions. [2022-11-21 13:58:58,897 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 54075 transitions. Word has length 13 [2022-11-21 13:58:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:58,899 INFO L495 AbstractCegarLoop]: Abstraction has 14402 states and 54075 transitions. [2022-11-21 13:58:58,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 54075 transitions. [2022-11-21 13:58:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:58:58,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:58,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:58,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:58:58,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:58:58,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 724176828, now seen corresponding path program 1 times [2022-11-21 13:58:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:58,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567030656] [2022-11-21 13:58:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:59,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567030656] [2022-11-21 13:58:59,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567030656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:59,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:59,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:58:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057467061] [2022-11-21 13:58:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:59,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:58:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:58:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:58:59,809 INFO L87 Difference]: Start difference. First operand 14402 states and 54075 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:00,844 INFO L93 Difference]: Finished difference Result 22666 states and 84547 transitions. [2022-11-21 13:59:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:59:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:59:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:00,954 INFO L225 Difference]: With dead ends: 22666 [2022-11-21 13:59:00,954 INFO L226 Difference]: Without dead ends: 22666 [2022-11-21 13:59:00,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:59:00,955 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 129 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:00,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 3 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:59:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22666 states. [2022-11-21 13:59:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22666 to 14802. [2022-11-21 13:59:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14802 states, 14656 states have (on average 3.7862308951965065) internal successors, (55491), 14801 states have internal predecessors, (55491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14802 states to 14802 states and 55491 transitions. [2022-11-21 13:59:01,607 INFO L78 Accepts]: Start accepts. Automaton has 14802 states and 55491 transitions. Word has length 14 [2022-11-21 13:59:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:01,608 INFO L495 AbstractCegarLoop]: Abstraction has 14802 states and 55491 transitions. [2022-11-21 13:59:01,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 14802 states and 55491 transitions. [2022-11-21 13:59:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:59:01,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:01,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:01,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:59:01,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1990989755, now seen corresponding path program 1 times [2022-11-21 13:59:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:01,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559491529] [2022-11-21 13:59:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:01,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559491529] [2022-11-21 13:59:01,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559491529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:01,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:01,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:59:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131737733] [2022-11-21 13:59:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:01,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:59:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:01,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:59:01,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:59:01,952 INFO L87 Difference]: Start difference. First operand 14802 states and 55491 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:02,405 INFO L93 Difference]: Finished difference Result 14722 states and 55147 transitions. [2022-11-21 13:59:02,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:59:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:59:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:02,502 INFO L225 Difference]: With dead ends: 14722 [2022-11-21 13:59:02,502 INFO L226 Difference]: Without dead ends: 14722 [2022-11-21 13:59:02,503 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 13:59:02,504 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:02,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:59:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14722 states. [2022-11-21 13:59:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14722 to 14722. [2022-11-21 13:59:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14722 states, 14576 states have (on average 3.7834110867178925) internal successors, (55147), 14721 states have internal predecessors, (55147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 55147 transitions. [2022-11-21 13:59:03,049 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 55147 transitions. Word has length 14 [2022-11-21 13:59:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:03,049 INFO L495 AbstractCegarLoop]: Abstraction has 14722 states and 55147 transitions. [2022-11-21 13:59:03,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 55147 transitions. [2022-11-21 13:59:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:59:03,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:03,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:03,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:59:03,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:03,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2110231355, now seen corresponding path program 1 times [2022-11-21 13:59:03,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:03,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600060193] [2022-11-21 13:59:03,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:03,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600060193] [2022-11-21 13:59:03,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600060193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:03,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:59:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110366624] [2022-11-21 13:59:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:59:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:59:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:59:03,413 INFO L87 Difference]: Start difference. First operand 14722 states and 55147 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:03,918 INFO L93 Difference]: Finished difference Result 23616 states and 87690 transitions. [2022-11-21 13:59:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:59:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 13:59:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:04,007 INFO L225 Difference]: With dead ends: 23616 [2022-11-21 13:59:04,007 INFO L226 Difference]: Without dead ends: 23616 [2022-11-21 13:59:04,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:59:04,008 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:04,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:59:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23616 states. [2022-11-21 13:59:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23616 to 15418. [2022-11-21 13:59:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15418 states, 15272 states have (on average 3.7989130434782608) internal successors, (58017), 15417 states have internal predecessors, (58017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15418 states to 15418 states and 58017 transitions. [2022-11-21 13:59:04,421 INFO L78 Accepts]: Start accepts. Automaton has 15418 states and 58017 transitions. Word has length 15 [2022-11-21 13:59:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:04,422 INFO L495 AbstractCegarLoop]: Abstraction has 15418 states and 58017 transitions. [2022-11-21 13:59:04,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15418 states and 58017 transitions. [2022-11-21 13:59:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:59:04,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:04,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:04,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:59:04,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash -67146827, now seen corresponding path program 1 times [2022-11-21 13:59:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:04,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313496345] [2022-11-21 13:59:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:04,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313496345] [2022-11-21 13:59:04,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313496345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:04,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:04,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:59:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616022010] [2022-11-21 13:59:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:04,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:59:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:59:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:59:04,990 INFO L87 Difference]: Start difference. First operand 15418 states and 58017 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:05,458 INFO L93 Difference]: Finished difference Result 17914 states and 65253 transitions. [2022-11-21 13:59:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:59:05,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 13:59:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:05,541 INFO L225 Difference]: With dead ends: 17914 [2022-11-21 13:59:05,542 INFO L226 Difference]: Without dead ends: 17914 [2022-11-21 13:59:05,542 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 13:59:05,544 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 83 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:05,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 2 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:59:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17914 states. [2022-11-21 13:59:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17914 to 14290. [2022-11-21 13:59:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14290 states, 14146 states have (on average 3.783896507846741) internal successors, (53527), 14289 states have internal predecessors, (53527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14290 states to 14290 states and 53527 transitions. [2022-11-21 13:59:06,010 INFO L78 Accepts]: Start accepts. Automaton has 14290 states and 53527 transitions. Word has length 15 [2022-11-21 13:59:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:06,011 INFO L495 AbstractCegarLoop]: Abstraction has 14290 states and 53527 transitions. [2022-11-21 13:59:06,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 14290 states and 53527 transitions. [2022-11-21 13:59:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:59:06,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:06,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:06,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:59:06,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2084159171, now seen corresponding path program 1 times [2022-11-21 13:59:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:06,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531012192] [2022-11-21 13:59:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:06,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:06,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:06,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531012192] [2022-11-21 13:59:06,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531012192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:06,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:06,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:59:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503977345] [2022-11-21 13:59:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:06,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:59:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:59:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:59:06,287 INFO L87 Difference]: Start difference. First operand 14290 states and 53527 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:06,634 INFO L93 Difference]: Finished difference Result 14254 states and 53380 transitions. [2022-11-21 13:59:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:59:06,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:59:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:06,685 INFO L225 Difference]: With dead ends: 14254 [2022-11-21 13:59:06,685 INFO L226 Difference]: Without dead ends: 14254 [2022-11-21 13:59:06,686 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 13:59:06,686 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:06,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:59:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14254 states. [2022-11-21 13:59:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14254 to 14254. [2022-11-21 13:59:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14254 states, 14110 states have (on average 3.783132530120482) internal successors, (53380), 14253 states have internal predecessors, (53380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 53380 transitions. [2022-11-21 13:59:06,995 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 53380 transitions. Word has length 16 [2022-11-21 13:59:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:06,995 INFO L495 AbstractCegarLoop]: Abstraction has 14254 states and 53380 transitions. [2022-11-21 13:59:06,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 53380 transitions. [2022-11-21 13:59:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:59:06,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:06,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:06,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:59:06,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2080676760, now seen corresponding path program 1 times [2022-11-21 13:59:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11985498] [2022-11-21 13:59:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:07,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11985498] [2022-11-21 13:59:07,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11985498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:07,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:07,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:59:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850198647] [2022-11-21 13:59:07,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:07,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:59:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:59:07,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:59:07,225 INFO L87 Difference]: Start difference. First operand 14254 states and 53380 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:07,680 INFO L93 Difference]: Finished difference Result 13306 states and 47832 transitions. [2022-11-21 13:59:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:59:07,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:59:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:07,723 INFO L225 Difference]: With dead ends: 13306 [2022-11-21 13:59:07,723 INFO L226 Difference]: Without dead ends: 13306 [2022-11-21 13:59:07,723 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 13:59:07,724 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 71 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:07,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:59:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13306 states. [2022-11-21 13:59:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13306 to 12114. [2022-11-21 13:59:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12114 states, 11970 states have (on average 3.75906432748538) internal successors, (44996), 12113 states have internal predecessors, (44996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12114 states to 12114 states and 44996 transitions. [2022-11-21 13:59:07,998 INFO L78 Accepts]: Start accepts. Automaton has 12114 states and 44996 transitions. Word has length 16 [2022-11-21 13:59:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:07,998 INFO L495 AbstractCegarLoop]: Abstraction has 12114 states and 44996 transitions. [2022-11-21 13:59:07,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 12114 states and 44996 transitions. [2022-11-21 13:59:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:59:08,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:08,001 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 13:59:08,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:59:08,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 328942533, now seen corresponding path program 1 times [2022-11-21 13:59:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:08,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884098688] [2022-11-21 13:59:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:09,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:09,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884098688] [2022-11-21 13:59:09,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884098688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:09,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:09,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:59:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785618655] [2022-11-21 13:59:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:09,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:59:09,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:09,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:59:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:59:09,800 INFO L87 Difference]: Start difference. First operand 12114 states and 44996 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 13:59:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:11,439 INFO L93 Difference]: Finished difference Result 17326 states and 65778 transitions. [2022-11-21 13:59:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:59:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 13:59:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:11,499 INFO L225 Difference]: With dead ends: 17326 [2022-11-21 13:59:11,499 INFO L226 Difference]: Without dead ends: 17326 [2022-11-21 13:59:11,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:59:11,500 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 172 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:11,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 16 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 13:59:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17326 states. [2022-11-21 13:59:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17326 to 12330. [2022-11-21 13:59:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12330 states, 12186 states have (on average 3.766781552601346) internal successors, (45902), 12329 states have internal predecessors, (45902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12330 states to 12330 states and 45902 transitions. [2022-11-21 13:59:11,809 INFO L78 Accepts]: Start accepts. Automaton has 12330 states and 45902 transitions. Word has length 17 [2022-11-21 13:59:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:11,810 INFO L495 AbstractCegarLoop]: Abstraction has 12330 states and 45902 transitions. [2022-11-21 13:59:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 13:59:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12330 states and 45902 transitions. [2022-11-21 13:59:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:59:11,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:11,814 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 13:59:11,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:59:11,814 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1662093037, now seen corresponding path program 2 times [2022-11-21 13:59:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:11,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445269499] [2022-11-21 13:59:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445269499] [2022-11-21 13:59:13,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445269499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:13,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:13,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:59:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507336060] [2022-11-21 13:59:13,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:13,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:59:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:59:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:59:13,495 INFO L87 Difference]: Start difference. First operand 12330 states and 45902 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 13:59:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:15,270 INFO L93 Difference]: Finished difference Result 13526 states and 51270 transitions. [2022-11-21 13:59:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:59:15,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 13:59:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:15,315 INFO L225 Difference]: With dead ends: 13526 [2022-11-21 13:59:15,315 INFO L226 Difference]: Without dead ends: 13526 [2022-11-21 13:59:15,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:59:15,316 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 96 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:15,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 19 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 13:59:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13526 states. [2022-11-21 13:59:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13526 to 12348. [2022-11-21 13:59:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12348 states, 12204 states have (on average 3.768108816781383) internal successors, (45986), 12347 states have internal predecessors, (45986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12348 states to 12348 states and 45986 transitions. [2022-11-21 13:59:15,569 INFO L78 Accepts]: Start accepts. Automaton has 12348 states and 45986 transitions. Word has length 17 [2022-11-21 13:59:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:15,570 INFO L495 AbstractCegarLoop]: Abstraction has 12348 states and 45986 transitions. [2022-11-21 13:59:15,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 13:59:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12348 states and 45986 transitions. [2022-11-21 13:59:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:59:15,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:15,574 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 13:59:15,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:59:15,574 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:15,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:15,575 INFO L85 PathProgramCache]: Analyzing trace with hash -76467720, now seen corresponding path program 1 times [2022-11-21 13:59:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:15,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297484720] [2022-11-21 13:59:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:15,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297484720] [2022-11-21 13:59:15,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297484720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:15,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:15,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:59:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119074878] [2022-11-21 13:59:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:59:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:15,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:59:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:59:15,843 INFO L87 Difference]: Start difference. First operand 12348 states and 45986 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 13:59:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:16,351 INFO L93 Difference]: Finished difference Result 11172 states and 39962 transitions. [2022-11-21 13:59:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:59:16,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 13:59:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:16,397 INFO L225 Difference]: With dead ends: 11172 [2022-11-21 13:59:16,397 INFO L226 Difference]: Without dead ends: 11172 [2022-11-21 13:59:16,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:59:16,398 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:16,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 7 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:59:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11172 states. [2022-11-21 13:59:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11172 to 10208. [2022-11-21 13:59:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10208 states, 10064 states have (on average 3.736287758346582) internal successors, (37602), 10207 states have internal predecessors, (37602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10208 states to 10208 states and 37602 transitions. [2022-11-21 13:59:16,684 INFO L78 Accepts]: Start accepts. Automaton has 10208 states and 37602 transitions. Word has length 17 [2022-11-21 13:59:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:16,684 INFO L495 AbstractCegarLoop]: Abstraction has 10208 states and 37602 transitions. [2022-11-21 13:59:16,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 13:59:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 10208 states and 37602 transitions. [2022-11-21 13:59:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:59:16,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:16,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:16,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:59:16,689 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:16,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash -545271442, now seen corresponding path program 1 times [2022-11-21 13:59:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:16,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468517717] [2022-11-21 13:59:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:18,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:18,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468517717] [2022-11-21 13:59:18,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468517717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:18,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:18,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:59:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432356583] [2022-11-21 13:59:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:18,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:59:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:59:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:59:18,366 INFO L87 Difference]: Start difference. First operand 10208 states and 37602 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:19,479 INFO L93 Difference]: Finished difference Result 11060 states and 41380 transitions. [2022-11-21 13:59:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:59:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 13:59:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:19,520 INFO L225 Difference]: With dead ends: 11060 [2022-11-21 13:59:19,520 INFO L226 Difference]: Without dead ends: 11060 [2022-11-21 13:59:19,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:59:19,521 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 101 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:19,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 15 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 13:59:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11060 states. [2022-11-21 13:59:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11060 to 10210. [2022-11-21 13:59:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10210 states, 10066 states have (on average 3.736340154977151) internal successors, (37610), 10209 states have internal predecessors, (37610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10210 states to 10210 states and 37610 transitions. [2022-11-21 13:59:19,753 INFO L78 Accepts]: Start accepts. Automaton has 10210 states and 37610 transitions. Word has length 18 [2022-11-21 13:59:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:19,754 INFO L495 AbstractCegarLoop]: Abstraction has 10210 states and 37610 transitions. [2022-11-21 13:59:19,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 10210 states and 37610 transitions. [2022-11-21 13:59:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:59:19,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:19,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:59:19,759 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:19,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1081424172, now seen corresponding path program 2 times [2022-11-21 13:59:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183875447] [2022-11-21 13:59:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:20,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183875447] [2022-11-21 13:59:20,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183875447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:20,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:20,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:59:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022998374] [2022-11-21 13:59:20,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:20,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:59:20,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:20,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:59:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:59:20,104 INFO L87 Difference]: Start difference. First operand 10210 states and 37610 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:20,532 INFO L93 Difference]: Finished difference Result 6169 states and 20409 transitions. [2022-11-21 13:59:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:59:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 13:59:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:20,555 INFO L225 Difference]: With dead ends: 6169 [2022-11-21 13:59:20,555 INFO L226 Difference]: Without dead ends: 5607 [2022-11-21 13:59:20,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:59:20,556 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:20,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:59:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5607 states. [2022-11-21 13:59:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5607 to 5595. [2022-11-21 13:59:20,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5595 states, 5475 states have (on average 3.3746118721461187) internal successors, (18476), 5594 states have internal predecessors, (18476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5595 states to 5595 states and 18476 transitions. [2022-11-21 13:59:20,714 INFO L78 Accepts]: Start accepts. Automaton has 5595 states and 18476 transitions. Word has length 18 [2022-11-21 13:59:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:20,715 INFO L495 AbstractCegarLoop]: Abstraction has 5595 states and 18476 transitions. [2022-11-21 13:59:20,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5595 states and 18476 transitions. [2022-11-21 13:59:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:59:20,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:20,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:20,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:59:20,720 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -332980473, now seen corresponding path program 1 times [2022-11-21 13:59:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:20,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726077576] [2022-11-21 13:59:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:23,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726077576] [2022-11-21 13:59:23,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726077576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:23,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:23,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:59:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759485899] [2022-11-21 13:59:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:23,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:59:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:59:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:59:23,079 INFO L87 Difference]: Start difference. First operand 5595 states and 18476 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:25,050 INFO L93 Difference]: Finished difference Result 6807 states and 22624 transitions. [2022-11-21 13:59:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:59:25,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:59:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:25,070 INFO L225 Difference]: With dead ends: 6807 [2022-11-21 13:59:25,070 INFO L226 Difference]: Without dead ends: 6807 [2022-11-21 13:59:25,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:59:25,071 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 112 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:25,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 15 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 13:59:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2022-11-21 13:59:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 5524. [2022-11-21 13:59:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5404 states have (on average 3.370096225018505) internal successors, (18212), 5523 states have internal predecessors, (18212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 18212 transitions. [2022-11-21 13:59:25,184 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 18212 transitions. Word has length 19 [2022-11-21 13:59:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:25,185 INFO L495 AbstractCegarLoop]: Abstraction has 5524 states and 18212 transitions. [2022-11-21 13:59:25,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 18212 transitions. [2022-11-21 13:59:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 13:59:25,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:25,189 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 13:59:25,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:59:25,190 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:25,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1840345776, now seen corresponding path program 1 times [2022-11-21 13:59:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:25,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116066220] [2022-11-21 13:59:25,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:25,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 13:59:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:25,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116066220] [2022-11-21 13:59:25,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116066220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:25,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:25,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:59:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764782115] [2022-11-21 13:59:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:25,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:59:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:59:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:59:25,508 INFO L87 Difference]: Start difference. First operand 5524 states and 18212 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:26,014 INFO L93 Difference]: Finished difference Result 2450 states and 7111 transitions. [2022-11-21 13:59:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:59:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 13:59:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:26,023 INFO L225 Difference]: With dead ends: 2450 [2022-11-21 13:59:26,023 INFO L226 Difference]: Without dead ends: 2075 [2022-11-21 13:59:26,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:59:26,024 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:26,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 7 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:59:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2022-11-21 13:59:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2055. [2022-11-21 13:59:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1991 states have (on average 2.9402310396785536) internal successors, (5854), 2054 states have internal predecessors, (5854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5854 transitions. [2022-11-21 13:59:26,074 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5854 transitions. Word has length 20 [2022-11-21 13:59:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:26,075 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 5854 transitions. [2022-11-21 13:59:26,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5854 transitions. [2022-11-21 13:59:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 13:59:26,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:26,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:26,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:59:26,081 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 164829188, now seen corresponding path program 1 times [2022-11-21 13:59:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026641294] [2022-11-21 13:59:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:26,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026641294] [2022-11-21 13:59:26,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026641294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:26,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:26,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:59:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403540087] [2022-11-21 13:59:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:26,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:59:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:59:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:59:26,510 INFO L87 Difference]: Start difference. First operand 2055 states and 5854 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:27,128 INFO L93 Difference]: Finished difference Result 1143 states and 3212 transitions. [2022-11-21 13:59:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:59:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 13:59:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:27,132 INFO L225 Difference]: With dead ends: 1143 [2022-11-21 13:59:27,132 INFO L226 Difference]: Without dead ends: 1001 [2022-11-21 13:59:27,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:59:27,133 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:27,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 9 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:59:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-11-21 13:59:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 981. [2022-11-21 13:59:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 963 states have (on average 2.888888888888889) internal successors, (2782), 980 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2782 transitions. [2022-11-21 13:59:27,173 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2782 transitions. Word has length 22 [2022-11-21 13:59:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:27,174 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 2782 transitions. [2022-11-21 13:59:27,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2782 transitions. [2022-11-21 13:59:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:59:27,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:27,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:27,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:59:27,184 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2146193955, now seen corresponding path program 1 times [2022-11-21 13:59:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:27,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362103996] [2022-11-21 13:59:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:30,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362103996] [2022-11-21 13:59:30,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362103996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:30,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:30,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:59:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169477177] [2022-11-21 13:59:30,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:59:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:59:30,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:59:30,072 INFO L87 Difference]: Start difference. First operand 981 states and 2782 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:32,335 INFO L93 Difference]: Finished difference Result 2899 states and 7700 transitions. [2022-11-21 13:59:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:59:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-21 13:59:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:32,343 INFO L225 Difference]: With dead ends: 2899 [2022-11-21 13:59:32,343 INFO L226 Difference]: Without dead ends: 2899 [2022-11-21 13:59:32,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:59:32,344 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 226 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:32,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 35 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-21 13:59:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2022-11-21 13:59:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1277. [2022-11-21 13:59:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1259 states have (on average 2.901509134233519) internal successors, (3653), 1276 states have internal predecessors, (3653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 3653 transitions. [2022-11-21 13:59:32,387 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 3653 transitions. Word has length 24 [2022-11-21 13:59:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:32,387 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 3653 transitions. [2022-11-21 13:59:32,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 3653 transitions. [2022-11-21 13:59:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:59:32,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:32,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:32,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:59:32,390 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 630218211, now seen corresponding path program 2 times [2022-11-21 13:59:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523413131] [2022-11-21 13:59:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:59:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523413131] [2022-11-21 13:59:32,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523413131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:32,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:32,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:59:32,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143366944] [2022-11-21 13:59:32,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:32,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:59:32,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:32,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:59:32,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:59:32,924 INFO L87 Difference]: Start difference. First operand 1277 states and 3653 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:33,392 INFO L93 Difference]: Finished difference Result 1118 states and 3321 transitions. [2022-11-21 13:59:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:59:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-21 13:59:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:33,395 INFO L225 Difference]: With dead ends: 1118 [2022-11-21 13:59:33,395 INFO L226 Difference]: Without dead ends: 1084 [2022-11-21 13:59:33,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:59:33,396 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 111 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:33,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:59:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-11-21 13:59:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 942. [2022-11-21 13:59:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 3.048936170212766) internal successors, (2866), 941 states have internal predecessors, (2866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2866 transitions. [2022-11-21 13:59:33,422 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2866 transitions. Word has length 24 [2022-11-21 13:59:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:33,422 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 2866 transitions. [2022-11-21 13:59:33,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:59:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2866 transitions. [2022-11-21 13:59:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 13:59:33,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:33,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:33,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:59:33,425 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 13:59:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash 743664786, now seen corresponding path program 1 times [2022-11-21 13:59:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:33,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436550243] [2022-11-21 13:59:33,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:59:33,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:59:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:59:33,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:59:33,804 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:59:33,806 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (101 of 102 remaining) [2022-11-21 13:59:33,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 102 remaining) [2022-11-21 13:59:33,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 102 remaining) [2022-11-21 13:59:33,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 102 remaining) [2022-11-21 13:59:33,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 102 remaining) [2022-11-21 13:59:33,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 102 remaining) [2022-11-21 13:59:33,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 102 remaining) [2022-11-21 13:59:33,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 102 remaining) [2022-11-21 13:59:33,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 102 remaining) [2022-11-21 13:59:33,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 102 remaining) [2022-11-21 13:59:33,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 102 remaining) [2022-11-21 13:59:33,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 102 remaining) [2022-11-21 13:59:33,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 102 remaining) [2022-11-21 13:59:33,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (88 of 102 remaining) [2022-11-21 13:59:33,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 102 remaining) [2022-11-21 13:59:33,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 102 remaining) [2022-11-21 13:59:33,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 102 remaining) [2022-11-21 13:59:33,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 102 remaining) [2022-11-21 13:59:33,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 102 remaining) [2022-11-21 13:59:33,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 102 remaining) [2022-11-21 13:59:33,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 102 remaining) [2022-11-21 13:59:33,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 102 remaining) [2022-11-21 13:59:33,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 102 remaining) [2022-11-21 13:59:33,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 102 remaining) [2022-11-21 13:59:33,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 102 remaining) [2022-11-21 13:59:33,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 102 remaining) [2022-11-21 13:59:33,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 102 remaining) [2022-11-21 13:59:33,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 102 remaining) [2022-11-21 13:59:33,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 102 remaining) [2022-11-21 13:59:33,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 102 remaining) [2022-11-21 13:59:33,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 102 remaining) [2022-11-21 13:59:33,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 102 remaining) [2022-11-21 13:59:33,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 102 remaining) [2022-11-21 13:59:33,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 102 remaining) [2022-11-21 13:59:33,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 102 remaining) [2022-11-21 13:59:33,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 102 remaining) [2022-11-21 13:59:33,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 102 remaining) [2022-11-21 13:59:33,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 102 remaining) [2022-11-21 13:59:33,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 102 remaining) [2022-11-21 13:59:33,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 102 remaining) [2022-11-21 13:59:33,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 102 remaining) [2022-11-21 13:59:33,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 102 remaining) [2022-11-21 13:59:33,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 102 remaining) [2022-11-21 13:59:33,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 102 remaining) [2022-11-21 13:59:33,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 102 remaining) [2022-11-21 13:59:33,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 102 remaining) [2022-11-21 13:59:33,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 102 remaining) [2022-11-21 13:59:33,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 102 remaining) [2022-11-21 13:59:33,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 102 remaining) [2022-11-21 13:59:33,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 102 remaining) [2022-11-21 13:59:33,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 102 remaining) [2022-11-21 13:59:33,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 102 remaining) [2022-11-21 13:59:33,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 102 remaining) [2022-11-21 13:59:33,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 102 remaining) [2022-11-21 13:59:33,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 102 remaining) [2022-11-21 13:59:33,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 102 remaining) [2022-11-21 13:59:33,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (45 of 102 remaining) [2022-11-21 13:59:33,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2022-11-21 13:59:33,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2022-11-21 13:59:33,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2022-11-21 13:59:33,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 102 remaining) [2022-11-21 13:59:33,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 102 remaining) [2022-11-21 13:59:33,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 102 remaining) [2022-11-21 13:59:33,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 102 remaining) [2022-11-21 13:59:33,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 102 remaining) [2022-11-21 13:59:33,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 102 remaining) [2022-11-21 13:59:33,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 102 remaining) [2022-11-21 13:59:33,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 102 remaining) [2022-11-21 13:59:33,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 102 remaining) [2022-11-21 13:59:33,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 102 remaining) [2022-11-21 13:59:33,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 102 remaining) [2022-11-21 13:59:33,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 102 remaining) [2022-11-21 13:59:33,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 102 remaining) [2022-11-21 13:59:33,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 102 remaining) [2022-11-21 13:59:33,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 102 remaining) [2022-11-21 13:59:33,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 102 remaining) [2022-11-21 13:59:33,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 102 remaining) [2022-11-21 13:59:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 102 remaining) [2022-11-21 13:59:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 102 remaining) [2022-11-21 13:59:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 102 remaining) [2022-11-21 13:59:33,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 102 remaining) [2022-11-21 13:59:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 102 remaining) [2022-11-21 13:59:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 102 remaining) [2022-11-21 13:59:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 102 remaining) [2022-11-21 13:59:33,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 102 remaining) [2022-11-21 13:59:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 102 remaining) [2022-11-21 13:59:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 102 remaining) [2022-11-21 13:59:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 102 remaining) [2022-11-21 13:59:33,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 102 remaining) [2022-11-21 13:59:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 102 remaining) [2022-11-21 13:59:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 102 remaining) [2022-11-21 13:59:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 102 remaining) [2022-11-21 13:59:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 102 remaining) [2022-11-21 13:59:33,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 102 remaining) [2022-11-21 13:59:33,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 102 remaining) [2022-11-21 13:59:33,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 102 remaining) [2022-11-21 13:59:33,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 102 remaining) [2022-11-21 13:59:33,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 102 remaining) [2022-11-21 13:59:33,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 102 remaining) [2022-11-21 13:59:33,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 102 remaining) [2022-11-21 13:59:33,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 102 remaining) [2022-11-21 13:59:33,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 102 remaining) [2022-11-21 13:59:33,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:59:33,841 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:33,851 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:59:33,851 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:59:33,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:59:33 BasicIcfg [2022-11-21 13:59:33,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:59:33,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:59:33,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:59:33,989 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:59:33,990 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:57:24" (3/4) ... [2022-11-21 13:59:33,993 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:59:33,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:59:33,994 INFO L158 Benchmark]: Toolchain (without parser) took 132740.51ms. Allocated memory was 197.1MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 149.6MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2022-11-21 13:59:33,994 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 138.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:59:33,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 819.09ms. Allocated memory is still 197.1MB. Free memory was 149.0MB in the beginning and 123.2MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-21 13:59:33,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.79ms. Allocated memory is still 197.1MB. Free memory was 123.2MB in the beginning and 120.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:59:33,996 INFO L158 Benchmark]: Boogie Preprocessor took 89.37ms. Allocated memory is still 197.1MB. Free memory was 120.6MB in the beginning and 118.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:59:33,996 INFO L158 Benchmark]: RCFGBuilder took 1739.83ms. Allocated memory is still 197.1MB. Free memory was 118.1MB in the beginning and 90.4MB in the end (delta: 27.7MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2022-11-21 13:59:33,996 INFO L158 Benchmark]: TraceAbstraction took 129980.26ms. Allocated memory was 197.1MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 89.4MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2022-11-21 13:59:33,997 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 14.5GB. Free memory is still 10.8GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:59:33,999 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.35ms. Allocated memory is still 138.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 819.09ms. Allocated memory is still 197.1MB. Free memory was 149.0MB in the beginning and 123.2MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.79ms. Allocated memory is still 197.1MB. Free memory was 123.2MB in the beginning and 120.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.37ms. Allocated memory is still 197.1MB. Free memory was 120.6MB in the beginning and 118.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1739.83ms. Allocated memory is still 197.1MB. Free memory was 118.1MB in the beginning and 90.4MB in the end (delta: 27.7MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * TraceAbstraction took 129980.26ms. Allocated memory was 197.1MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 89.4MB in the beginning and 10.8GB in the end (delta: -10.7GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 14.5GB. Free memory is still 10.8GB. 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: 49.3s, 222 PlacesBefore, 105 PlacesAfterwards, 211 TransitionsBefore, 93 TransitionsAfterwards, 10744 CoEnabledTransitionPairs, 8 FixpointIterations, 76 TrivialSequentialCompositions, 120 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 203 TotalNumberOfCompositions, 52253 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21319, independent: 20625, independent conditional: 0, independent unconditional: 20625, dependent: 617, dependent conditional: 0, dependent unconditional: 617, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7112, independent: 6959, independent conditional: 0, independent unconditional: 6959, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7112, independent: 5983, independent conditional: 0, independent unconditional: 5983, dependent: 1129, dependent conditional: 0, dependent unconditional: 1129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1129, independent: 976, independent conditional: 0, independent unconditional: 976, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14448, independent: 4545, independent conditional: 0, independent unconditional: 4545, dependent: 1411, dependent conditional: 0, dependent unconditional: 1411, unknown: 8493, unknown conditional: 0, unknown unconditional: 8493] ], Cache Queries: [ total: 21319, independent: 13666, independent conditional: 0, independent unconditional: 13666, dependent: 473, dependent conditional: 0, dependent unconditional: 473, unknown: 7180, unknown conditional: 0, unknown unconditional: 7180] , Statistics on independence cache: Total cache size (in pairs): 1717, Positive cache size: 1651, Positive conditional cache size: 0, Positive unconditional cache size: 1651, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2421, ((void *)0), P0, ((void *)0))=-2, t2421={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L886] 0 pthread_t t2422; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={5:0}, t2422={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2422, ((void *)0), P1, ((void *)0))=-1, t2421={5:0}, t2422={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2423, ((void *)0), P2, ((void *)0))=0, t2421={5:0}, t2422={6:0}, t2423={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 \read(x) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 3 return 0; [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L890] 0 pthread_t t2424; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421={5:0}, t2422={6:0}, t2423={4:0}, t2424={9:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2424, ((void *)0), P3, ((void *)0))=1, t2421={5:0}, t2422={6:0}, t2423={4:0}, t2424={9:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 4 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=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=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L871] 4 return 0; [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421={5:0}, t2422={6:0}, t2423={4:0}, t2424={9:0}, weak$$choice0=9, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 882]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 885]: 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: 889]: 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: 891]: 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: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 284 locations, 102 error locations. Started 1 CEGAR loops. OverallTime: 129.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.9s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 69.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1661 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1661 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5134 IncrementalHoareTripleChecker+Invalid, 5499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 34 mSDtfsCounter, 5134 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479588occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 37869 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 3250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 13:59:34,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:59:36,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:59:36,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:59:36,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:59:36,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:59:36,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:59:36,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:59:36,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:59:36,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:59:36,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:59:36,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:59:36,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:59:36,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:59:36,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:59:36,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:59:36,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:59:36,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:59:36,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:59:36,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:59:36,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:59:36,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:59:36,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:59:36,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:59:36,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:59:36,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:59:36,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:59:36,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:59:36,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:59:36,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:59:36,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:59:36,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:59:36,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:59:36,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:59:36,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:59:36,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:59:36,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:59:36,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:59:36,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:59:36,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:59:36,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:59:36,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:59:36,932 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 13:59:36,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:59:36,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:59:36,980 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:59:36,980 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:59:36,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:59:36,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:59:36,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:59:36,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:59:36,983 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:59:36,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:59:36,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:59:36,985 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:59:36,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:59:36,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:59:36,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:59:36,986 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:59:36,987 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:59:36,987 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:59:36,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:59:36,987 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:59:36,988 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 13:59:36,988 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 13:59:36,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:59:36,989 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:59:36,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:59:36,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:59:36,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:59:36,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:59:36,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:59:36,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:59:36,991 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 13:59:36,991 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 13:59:36,992 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 13:59:36,992 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2022-11-21 13:59:37,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:59:37,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:59:37,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:59:37,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:59:37,418 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:59:37,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-11-21 13:59:40,672 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:59:41,093 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:59:41,095 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2022-11-21 13:59:41,118 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data/d36ae80b3/e6341afbb27943d5b14d2f1da27d6e18/FLAGf47e7e5c9 [2022-11-21 13:59:41,149 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/data/d36ae80b3/e6341afbb27943d5b14d2f1da27d6e18 [2022-11-21 13:59:41,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:59:41,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:59:41,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:59:41,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:59:41,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:59:41,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:59:41" (1/1) ... [2022-11-21 13:59:41,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ffd5ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:41, skipping insertion in model container [2022-11-21 13:59:41,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:59:41" (1/1) ... [2022-11-21 13:59:41,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:59:41,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:59:41,544 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-11-21 13:59:41,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:59:41,976 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:59:41,991 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_b38116cd-ba9f-442d-9fb7-79efc8af35cf/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i[994,1007] [2022-11-21 13:59:42,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:59:42,183 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:59:42,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42 WrapperNode [2022-11-21 13:59:42,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:59:42,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:59:42,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:59:42,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:59:42,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,260 INFO L138 Inliner]: procedures = 181, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 195 [2022-11-21 13:59:42,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:59:42,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:59:42,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:59:42,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:59:42,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,305 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:59:42,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:59:42,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:59:42,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:59:42,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (1/1) ... [2022-11-21 13:59:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:59:42,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:42,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:42,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:59:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 13:59:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:59:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:59:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:59:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:59:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 13:59:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 13:59:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-21 13:59:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:59:42,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:59:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:59:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:59:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:59:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:59:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-21 13:59:42,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-21 13:59:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:59:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:59:42,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:59:42,432 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:59:42,645 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:59:42,648 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:59:43,725 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:59:44,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:59:44,766 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:59:44,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:44 BoogieIcfgContainer [2022-11-21 13:59:44,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:59:44,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:59:44,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:59:44,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:59:44,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:59:41" (1/3) ... [2022-11-21 13:59:44,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5341cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:59:44, skipping insertion in model container [2022-11-21 13:59:44,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:59:42" (2/3) ... [2022-11-21 13:59:44,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5341cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:59:44, skipping insertion in model container [2022-11-21 13:59:44,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:44" (3/3) ... [2022-11-21 13:59:44,783 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2022-11-21 13:59:44,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:59:44,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-11-21 13:59:44,805 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:59:45,091 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:59:45,141 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:59:45,168 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 212 transitions, 444 flow [2022-11-21 13:59:45,174 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 212 transitions, 444 flow [2022-11-21 13:59:45,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 212 transitions, 444 flow [2022-11-21 13:59:45,347 INFO L130 PetriNetUnfolder]: 2/208 cut-off events. [2022-11-21 13:59:45,347 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:59:45,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 2/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 326 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2022-11-21 13:59:45,365 INFO L119 LiptonReduction]: Number of co-enabled transitions 10744 [2022-11-21 14:00:19,505 WARN L233 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 201 DAG size of output: 198 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 14:00:29,419 WARN L233 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 230 DAG size of output: 227 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 14:01:09,668 INFO L134 LiptonReduction]: Checked pairs total: 55370 [2022-11-21 14:01:09,668 INFO L136 LiptonReduction]: Total number of compositions: 206 [2022-11-21 14:01:09,676 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 93 transitions, 206 flow [2022-11-21 14:01:27,332 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:27,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 14:01:27,403 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;@232607cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 14:01:27,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2022-11-21 14:01:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 14:01:28,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:28,067 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 14:01:28,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1369, now seen corresponding path program 1 times [2022-11-21 14:01:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:28,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449556316] [2022-11-21 14:01:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:28,086 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 14:01:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:28,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:28,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:28,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 14:01:28,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:28,341 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 14:01:28,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:28,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:28,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449556316] [2022-11-21 14:01:28,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449556316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:28,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 14:01:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081942218] [2022-11-21 14:01:28,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:28,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 14:01:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 14:01:28,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 14:01:29,307 INFO L87 Difference]: Start difference. First operand has 479588 states, 402419 states have (on average 5.512257125036343) internal successors, (2218237), 479587 states have internal predecessors, (2218237), 0 states have call successors, (0), 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 14:01:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:33,318 INFO L93 Difference]: Finished difference Result 77980 states and 344739 transitions. [2022-11-21 14:01:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 14:01:33,322 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 14:01:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:35,148 INFO L225 Difference]: With dead ends: 77980 [2022-11-21 14:01:35,163 INFO L226 Difference]: Without dead ends: 77980 [2022-11-21 14:01:35,164 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 14:01:35,169 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:35,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 14:01:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77980 states. [2022-11-21 14:01:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77980 to 77980. [2022-11-21 14:01:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77980 states, 72311 states have (on average 4.767448935846551) internal successors, (344739), 77979 states have internal predecessors, (344739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77980 states to 77980 states and 344739 transitions. [2022-11-21 14:01:40,450 INFO L78 Accepts]: Start accepts. Automaton has 77980 states and 344739 transitions. Word has length 1 [2022-11-21 14:01:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:40,451 INFO L495 AbstractCegarLoop]: Abstraction has 77980 states and 344739 transitions. [2022-11-21 14:01:40,451 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 14:01:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 77980 states and 344739 transitions. [2022-11-21 14:01:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 14:01:40,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:40,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 14:01:40,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:40,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:40,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 41877599, now seen corresponding path program 1 times [2022-11-21 14:01:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180589938] [2022-11-21 14:01:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:40,668 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 14:01:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:40,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:40,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:40,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 14:01:40,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:41,156 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 14:01:41,157 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 14:01:41,229 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 14:01:41,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:41,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:41,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180589938] [2022-11-21 14:01:41,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180589938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:41,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:41,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 14:01:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246232788] [2022-11-21 14:01:41,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:01:41,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:41,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:01:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:01:41,233 INFO L87 Difference]: Start difference. First operand 77980 states and 344739 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:42,297 INFO L93 Difference]: Finished difference Result 39826 states and 171519 transitions. [2022-11-21 14:01:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:01:42,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 14:01:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:42,593 INFO L225 Difference]: With dead ends: 39826 [2022-11-21 14:01:42,593 INFO L226 Difference]: Without dead ends: 39826 [2022-11-21 14:01:42,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:01:42,595 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:42,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 14:01:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39826 states. [2022-11-21 14:01:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39826 to 39826. [2022-11-21 14:01:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39826 states, 38087 states have (on average 4.503347598918266) internal successors, (171519), 39825 states have internal predecessors, (171519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39826 states to 39826 states and 171519 transitions. [2022-11-21 14:01:44,713 INFO L78 Accepts]: Start accepts. Automaton has 39826 states and 171519 transitions. Word has length 4 [2022-11-21 14:01:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:44,714 INFO L495 AbstractCegarLoop]: Abstraction has 39826 states and 171519 transitions. [2022-11-21 14:01:44,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 39826 states and 171519 transitions. [2022-11-21 14:01:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 14:01:44,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:44,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 14:01:44,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:44,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash 41877600, now seen corresponding path program 1 times [2022-11-21 14:01:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:44,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664756425] [2022-11-21 14:01:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:44,918 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 14:01:44,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:44,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:44,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:45,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 14:01:45,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:45,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:45,271 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 14:01:45,343 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 14:01:45,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:45,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:45,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664756425] [2022-11-21 14:01:45,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664756425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:45,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:45,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 14:01:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77211637] [2022-11-21 14:01:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:01:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:01:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:01:45,346 INFO L87 Difference]: Start difference. First operand 39826 states and 171519 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:45,718 INFO L93 Difference]: Finished difference Result 11558 states and 47571 transitions. [2022-11-21 14:01:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:01:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-21 14:01:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:45,799 INFO L225 Difference]: With dead ends: 11558 [2022-11-21 14:01:45,800 INFO L226 Difference]: Without dead ends: 11558 [2022-11-21 14:01:45,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:01:45,805 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:45,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 14:01:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11558 states. [2022-11-21 14:01:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11558 to 11558. [2022-11-21 14:01:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11558 states, 11361 states have (on average 4.187219434908899) internal successors, (47571), 11557 states have internal predecessors, (47571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11558 states to 11558 states and 47571 transitions. [2022-11-21 14:01:46,950 INFO L78 Accepts]: Start accepts. Automaton has 11558 states and 47571 transitions. Word has length 4 [2022-11-21 14:01:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:46,951 INFO L495 AbstractCegarLoop]: Abstraction has 11558 states and 47571 transitions. [2022-11-21 14:01:46,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 11558 states and 47571 transitions. [2022-11-21 14:01:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 14:01:46,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:46,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 14:01:46,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:47,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:47,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1590395157, now seen corresponding path program 1 times [2022-11-21 14:01:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:47,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069826935] [2022-11-21 14:01:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:47,159 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 14:01:47,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:47,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:47,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:47,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 14:01:47,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:47,485 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 14:01:47,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:47,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:47,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069826935] [2022-11-21 14:01:47,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069826935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:47,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:47,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 14:01:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884362151] [2022-11-21 14:01:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:47,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:01:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:01:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:01:47,488 INFO L87 Difference]: Start difference. First operand 11558 states and 47571 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:48,083 INFO L93 Difference]: Finished difference Result 9726 states and 39747 transitions. [2022-11-21 14:01:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:01:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-21 14:01:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:48,153 INFO L225 Difference]: With dead ends: 9726 [2022-11-21 14:01:48,154 INFO L226 Difference]: Without dead ends: 9726 [2022-11-21 14:01:48,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 14:01:48,155 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:48,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 14:01:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9726 states. [2022-11-21 14:01:48,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9726 to 9726. [2022-11-21 14:01:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9726 states, 9580 states have (on average 4.148956158663883) internal successors, (39747), 9725 states have internal predecessors, (39747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9726 states to 9726 states and 39747 transitions. [2022-11-21 14:01:48,610 INFO L78 Accepts]: Start accepts. Automaton has 9726 states and 39747 transitions. Word has length 6 [2022-11-21 14:01:48,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:48,611 INFO L495 AbstractCegarLoop]: Abstraction has 9726 states and 39747 transitions. [2022-11-21 14:01:48,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 9726 states and 39747 transitions. [2022-11-21 14:01:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 14:01:48,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:48,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:48,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:48,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:48,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 972044723, now seen corresponding path program 1 times [2022-11-21 14:01:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:48,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512375609] [2022-11-21 14:01:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:48,816 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 14:01:48,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:48,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:48,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:49,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 14:01:49,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:49,249 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 14:01:49,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:49,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:49,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512375609] [2022-11-21 14:01:49,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512375609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:49,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:49,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 14:01:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280237456] [2022-11-21 14:01:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:49,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 14:01:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 14:01:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 14:01:49,252 INFO L87 Difference]: Start difference. First operand 9726 states and 39747 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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 14:01:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:49,772 INFO L93 Difference]: Finished difference Result 9598 states and 39203 transitions. [2022-11-21 14:01:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 14:01:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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 14:01:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:49,842 INFO L225 Difference]: With dead ends: 9598 [2022-11-21 14:01:49,843 INFO L226 Difference]: Without dead ends: 9598 [2022-11-21 14:01:49,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 14:01:49,845 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:49,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 14:01:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2022-11-21 14:01:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 9598. [2022-11-21 14:01:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9598 states, 9452 states have (on average 4.147587812103259) internal successors, (39203), 9597 states have internal predecessors, (39203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 39203 transitions. [2022-11-21 14:01:50,321 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 39203 transitions. Word has length 13 [2022-11-21 14:01:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:50,322 INFO L495 AbstractCegarLoop]: Abstraction has 9598 states and 39203 transitions. [2022-11-21 14:01:50,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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 14:01:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 39203 transitions. [2022-11-21 14:01:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 14:01:50,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:50,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:50,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:50,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:50,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:50,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash -576368540, now seen corresponding path program 1 times [2022-11-21 14:01:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:50,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113457892] [2022-11-21 14:01:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:50,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 14:01:50,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:50,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:50,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:50,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 14:01:50,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:50,993 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 14:01:50,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:50,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:50,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113457892] [2022-11-21 14:01:50,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113457892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:50,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:50,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 14:01:50,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628397184] [2022-11-21 14:01:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:50,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 14:01:50,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:50,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 14:01:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 14:01:50,996 INFO L87 Difference]: Start difference. First operand 9598 states and 39203 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:51,717 INFO L93 Difference]: Finished difference Result 5825 states and 20418 transitions. [2022-11-21 14:01:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:01:51,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 14:01:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:52,141 INFO L225 Difference]: With dead ends: 5825 [2022-11-21 14:01:52,141 INFO L226 Difference]: Without dead ends: 5505 [2022-11-21 14:01:52,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 14:01:52,142 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:52,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 5 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 14:01:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2022-11-21 14:01:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 5505. [2022-11-21 14:01:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5505 states, 5383 states have (on average 3.5916775032509753) internal successors, (19334), 5504 states have internal predecessors, (19334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 19334 transitions. [2022-11-21 14:01:52,296 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 19334 transitions. Word has length 14 [2022-11-21 14:01:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:52,296 INFO L495 AbstractCegarLoop]: Abstraction has 5505 states and 19334 transitions. [2022-11-21 14:01:52,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 19334 transitions. [2022-11-21 14:01:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 14:01:52,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:52,304 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 14:01:52,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:52,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:52,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 288404540, now seen corresponding path program 1 times [2022-11-21 14:01:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:52,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208144116] [2022-11-21 14:01:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:52,527 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 14:01:52,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:52,529 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:52,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:52,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 14:01:52,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:52,978 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 14:01:52,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:52,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:52,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208144116] [2022-11-21 14:01:52,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208144116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:52,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:52,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 14:01:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804296360] [2022-11-21 14:01:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:52,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 14:01:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 14:01:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 14:01:52,980 INFO L87 Difference]: Start difference. First operand 5505 states and 19334 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 14:01:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:53,930 INFO L93 Difference]: Finished difference Result 2190 states and 6337 transitions. [2022-11-21 14:01:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 14:01:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 14:01:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:53,939 INFO L225 Difference]: With dead ends: 2190 [2022-11-21 14:01:53,939 INFO L226 Difference]: Without dead ends: 1978 [2022-11-21 14:01:53,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:53,940 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:53,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 14:01:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2022-11-21 14:01:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2022-11-21 14:01:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1912 states have (on average 2.959205020920502) internal successors, (5658), 1977 states have internal predecessors, (5658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 5658 transitions. [2022-11-21 14:01:53,988 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 5658 transitions. Word has length 17 [2022-11-21 14:01:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:53,989 INFO L495 AbstractCegarLoop]: Abstraction has 1978 states and 5658 transitions. [2022-11-21 14:01:53,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 14:01:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 5658 transitions. [2022-11-21 14:01:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 14:01:53,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:53,992 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 14:01:54,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:54,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:54,214 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 595468985, now seen corresponding path program 1 times [2022-11-21 14:01:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:54,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010775082] [2022-11-21 14:01:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:54,216 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 14:01:54,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:54,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:54,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:54,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 14:01:54,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:54,815 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 14:01:54,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:54,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:54,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010775082] [2022-11-21 14:01:54,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010775082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:54,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:54,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 14:01:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000266905] [2022-11-21 14:01:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:54,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:01:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:01:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:01:54,817 INFO L87 Difference]: Start difference. First operand 1978 states and 5658 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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 14:01:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:56,169 INFO L93 Difference]: Finished difference Result 886 states and 2465 transitions. [2022-11-21 14:01:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:01:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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 14:01:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:56,172 INFO L225 Difference]: With dead ends: 886 [2022-11-21 14:01:56,172 INFO L226 Difference]: Without dead ends: 809 [2022-11-21 14:01:56,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:01:56,173 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:56,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 16 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-21 14:01:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-21 14:01:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2022-11-21 14:01:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 789 states have (on average 2.868187579214195) internal successors, (2263), 808 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 2263 transitions. [2022-11-21 14:01:56,196 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 2263 transitions. Word has length 20 [2022-11-21 14:01:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:56,196 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 2263 transitions. [2022-11-21 14:01:56,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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 14:01:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 2263 transitions. [2022-11-21 14:01:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 14:01:56,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:56,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:56,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:56,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:56,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1582639335, now seen corresponding path program 1 times [2022-11-21 14:01:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:56,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501947066] [2022-11-21 14:01:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:56,417 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 14:01:56,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:56,418 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:56,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:56,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 14:01:56,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:01:56,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:56,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:01:56,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501947066] [2022-11-21 14:01:56,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501947066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:56,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:01:56,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 14:01:56,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218878688] [2022-11-21 14:01:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:56,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:01:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:56,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:01:56,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:01:56,929 INFO L87 Difference]: Start difference. First operand 809 states and 2263 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:58,569 INFO L93 Difference]: Finished difference Result 646 states and 1947 transitions. [2022-11-21 14:01:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 14:01:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-21 14:01:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:58,572 INFO L225 Difference]: With dead ends: 646 [2022-11-21 14:01:58,572 INFO L226 Difference]: Without dead ends: 632 [2022-11-21 14:01:58,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:01:58,573 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:58,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-21 14:01:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-21 14:01:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2022-11-21 14:01:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 628 states have (on average 3.0589171974522293) internal successors, (1921), 631 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1921 transitions. [2022-11-21 14:01:58,591 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1921 transitions. Word has length 23 [2022-11-21 14:01:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:58,591 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1921 transitions. [2022-11-21 14:01:58,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1921 transitions. [2022-11-21 14:01:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 14:01:58,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:58,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:58,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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)] Ended with exit code 0 [2022-11-21 14:01:58,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:58,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:01:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:58,811 INFO L85 PathProgramCache]: Analyzing trace with hash 958084573, now seen corresponding path program 1 times [2022-11-21 14:01:58,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:01:58,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42637719] [2022-11-21 14:01:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:58,812 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 14:01:58,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:01:58,814 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:58,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:01:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:59,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 14:01:59,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:02:06,719 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 14:02:06,728 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 14:02:06,765 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 282 treesize of output 258 [2022-11-21 14:02:07,801 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 14:02:07,899 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 14:02:07,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:02:07,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:02:07,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42637719] [2022-11-21 14:02:07,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42637719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:02:07,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:02:07,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 14:02:07,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236181196] [2022-11-21 14:02:07,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:02:07,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:02:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:02:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:02:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:02:07,901 INFO L87 Difference]: Start difference. First operand 632 states and 1921 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:02:09,082 INFO L93 Difference]: Finished difference Result 1079 states and 3274 transitions. [2022-11-21 14:02:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:02:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 14:02:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:02:09,085 INFO L225 Difference]: With dead ends: 1079 [2022-11-21 14:02:09,085 INFO L226 Difference]: Without dead ends: 1079 [2022-11-21 14:02:09,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 14:02:09,086 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:02:09,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 7 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 14:02:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-11-21 14:02:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 988. [2022-11-21 14:02:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 985 states have (on average 3.045685279187817) internal successors, (3000), 987 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3000 transitions. [2022-11-21 14:02:09,125 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3000 transitions. Word has length 26 [2022-11-21 14:02:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:02:09,126 INFO L495 AbstractCegarLoop]: Abstraction has 988 states and 3000 transitions. [2022-11-21 14:02:09,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3000 transitions. [2022-11-21 14:02:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 14:02:09,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:02:09,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:02:09,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:09,346 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:02:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:02:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1948491533, now seen corresponding path program 1 times [2022-11-21 14:02:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:02:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619931717] [2022-11-21 14:02:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:02:09,348 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 14:02:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:02:09,349 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:09,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:02:09,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 14:02:09,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:02:09,988 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 14:02:14,247 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 14:02:14,260 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 14:02:14,455 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 14:02:14,495 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 14:02:14,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:02:14,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:02:14,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619931717] [2022-11-21 14:02:14,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619931717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:02:14,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:02:14,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 14:02:14,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981036097] [2022-11-21 14:02:14,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:02:14,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:02:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:02:14,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:02:14,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 14:02:14,497 INFO L87 Difference]: Start difference. First operand 988 states and 3000 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:02:15,872 INFO L93 Difference]: Finished difference Result 1375 states and 4048 transitions. [2022-11-21 14:02:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 14:02:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-21 14:02:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:02:15,877 INFO L225 Difference]: With dead ends: 1375 [2022-11-21 14:02:15,877 INFO L226 Difference]: Without dead ends: 1375 [2022-11-21 14:02:15,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-21 14:02:15,878 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:02:15,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 6 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-21 14:02:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2022-11-21 14:02:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 630. [2022-11-21 14:02:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 3.055732484076433) internal successors, (1919), 629 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1919 transitions. [2022-11-21 14:02:15,897 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1919 transitions. Word has length 26 [2022-11-21 14:02:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:02:15,898 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1919 transitions. [2022-11-21 14:02:15,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1919 transitions. [2022-11-21 14:02:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 14:02:15,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:02:15,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:02:15,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:16,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:16,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:02:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:02:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -364148044, now seen corresponding path program 1 times [2022-11-21 14:02:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:02:16,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407758901] [2022-11-21 14:02:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:02:16,102 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 14:02:16,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:02:16,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:16,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:02:16,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 14:02:16,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:02:18,587 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 282 treesize of output 258 [2022-11-21 14:02:18,886 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 14:02:18,894 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 14:02:19,189 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 14:02:19,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:02:19,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 14:02:19,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407758901] [2022-11-21 14:02:19,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407758901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:02:19,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 14:02:19,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 14:02:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161108971] [2022-11-21 14:02:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:02:19,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 14:02:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:02:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 14:02:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 14:02:19,191 INFO L87 Difference]: Start difference. First operand 630 states and 1919 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:02:20,257 INFO L93 Difference]: Finished difference Result 953 states and 2897 transitions. [2022-11-21 14:02:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 14:02:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-21 14:02:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:02:20,262 INFO L225 Difference]: With dead ends: 953 [2022-11-21 14:02:20,262 INFO L226 Difference]: Without dead ends: 953 [2022-11-21 14:02:20,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-21 14:02:20,264 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 14:02:20,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 14:02:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-11-21 14:02:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 812. [2022-11-21 14:02:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.0135802469135804) internal successors, (2441), 811 states have internal predecessors, (2441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2441 transitions. [2022-11-21 14:02:20,291 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2441 transitions. Word has length 27 [2022-11-21 14:02:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:02:20,291 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2441 transitions. [2022-11-21 14:02:20,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2441 transitions. [2022-11-21 14:02:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 14:02:20,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:02:20,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:02:20,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:20,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:20,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 99 more)] === [2022-11-21 14:02:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:02:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash -860836724, now seen corresponding path program 2 times [2022-11-21 14:02:20,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 14:02:20,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796069706] [2022-11-21 14:02:20,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:02:20,510 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 14:02:20,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 14:02:20,511 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:20,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b38116cd-ba9f-442d-9fb7-79efc8af35cf/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 14:02:20,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 14:02:20,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:02:20,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-21 14:02:20,943 INFO L286 TraceCheckSpWp]: Computing forward predicates...