./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- 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-6b4ec56 [2022-11-20 10:57:39,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:57:39,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:57:39,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:57:39,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:57:39,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:57:39,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:57:39,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:57:39,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:57:39,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:57:39,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:57:39,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:57:39,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:57:39,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:57:39,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:57:39,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:57:39,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:57:39,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:57:39,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:57:39,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:57:39,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:57:39,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:57:39,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:57:39,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:57:39,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:57:39,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:57:39,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:57:39,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:57:39,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:57:39,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:57:39,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:57:39,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:57:39,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:57:39,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:57:39,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:57:39,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:57:39,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:57:39,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:57:39,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:57:39,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:57:39,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:57:39,603 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:57:39,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:57:39,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:57:39,646 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:57:39,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:57:39,647 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:57:39,647 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:57:39,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:57:39,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:57:39,649 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:57:39,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:57:39,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:57:39,650 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:57:39,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:57:39,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:57:39,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:57:39,651 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:57:39,652 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:57:39,652 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:57:39,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:57:39,652 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:57:39,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:57:39,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:57:39,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:57:39,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:57:39,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:57:39,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:39,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:57:39,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:57:39,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:57:39,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:57:39,656 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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2022-11-20 10:57:39,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:57:40,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:57:40,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:57:40,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:57:40,024 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:57:40,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-20 10:57:43,131 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:57:43,421 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:57:43,421 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-20 10:57:43,437 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data/e7c2873ab/a0aec9a809c24325baa2cde3a89fe41c/FLAG8d172ac05 [2022-11-20 10:57:43,458 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data/e7c2873ab/a0aec9a809c24325baa2cde3a89fe41c [2022-11-20 10:57:43,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:57:43,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:57:43,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:57:43,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:57:43,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:57:43,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:43" (1/1) ... [2022-11-20 10:57:43,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dcbbe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:43, skipping insertion in model container [2022-11-20 10:57:43,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:43" (1/1) ... [2022-11-20 10:57:43,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:57:43,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:57:43,721 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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-20 10:57:43,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:57:43,979 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:57:43,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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-20 10:57:44,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:57:44,085 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:57:44,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44 WrapperNode [2022-11-20 10:57:44,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:57:44,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:57:44,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:57:44,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:57:44,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,147 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-11-20 10:57:44,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:57:44,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:57:44,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:57:44,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:57:44,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,182 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:57:44,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:57:44,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:57:44,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:57:44,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (1/1) ... [2022-11-20 10:57:44,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:44,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:57:44,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:57:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:57:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:57:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:57:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:57:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:57:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:57:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:57:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:57:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:57:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:57:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:57:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:57:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:57:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:57:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:57:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:57:44,296 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:57:44,582 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:57:44,584 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:57:45,180 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:57:45,891 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:57:45,892 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:57:45,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:45 BoogieIcfgContainer [2022-11-20 10:57:45,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:57:45,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:57:45,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:57:45,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:57:45,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:57:43" (1/3) ... [2022-11-20 10:57:45,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e56d13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:45, skipping insertion in model container [2022-11-20 10:57:45,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:44" (2/3) ... [2022-11-20 10:57:45,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e56d13f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:45, skipping insertion in model container [2022-11-20 10:57:45,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:45" (3/3) ... [2022-11-20 10:57:45,907 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-11-20 10:57:45,928 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:57:45,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-20 10:57:45,928 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:57:46,073 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:57:46,119 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:57:46,138 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 174 transitions, 363 flow [2022-11-20 10:57:46,141 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 174 transitions, 363 flow [2022-11-20 10:57:46,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 363 flow [2022-11-20 10:57:46,246 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2022-11-20 10:57:46,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:57:46,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 221 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-11-20 10:57:46,256 INFO L119 LiptonReduction]: Number of co-enabled transitions 5328 [2022-11-20 10:58:05,348 INFO L134 LiptonReduction]: Checked pairs total: 23452 [2022-11-20 10:58:05,348 INFO L136 LiptonReduction]: Total number of compositions: 153 [2022-11-20 10:58:05,357 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 66 transitions, 147 flow [2022-11-20 10:58:05,938 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:05,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:58:05,970 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;@6c17e6a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:58:05,970 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-11-20 10:58:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:58:06,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:06,017 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:58:06,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1061, now seen corresponding path program 1 times [2022-11-20 10:58:06,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:06,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614916445] [2022-11-20 10:58:06,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:06,169 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-20 10:58:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:06,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614916445] [2022-11-20 10:58:06,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614916445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:06,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:06,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:58:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241113640] [2022-11-20 10:58:06,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:06,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:58:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:06,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:58:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:58:06,249 INFO L87 Difference]: Start difference. First operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 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-20 10:58:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:06,477 INFO L93 Difference]: Finished difference Result 6714 states and 23324 transitions. [2022-11-20 10:58:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:58:06,480 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-20 10:58:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:06,558 INFO L225 Difference]: With dead ends: 6714 [2022-11-20 10:58:06,558 INFO L226 Difference]: Without dead ends: 6714 [2022-11-20 10:58:06,559 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-20 10:58:06,563 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:06,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2022-11-20 10:58:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 6714. [2022-11-20 10:58:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6714 states, 6337 states have (on average 3.68060596496765) internal successors, (23324), 6713 states have internal predecessors, (23324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6714 states to 6714 states and 23324 transitions. [2022-11-20 10:58:07,089 INFO L78 Accepts]: Start accepts. Automaton has 6714 states and 23324 transitions. Word has length 1 [2022-11-20 10:58:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:07,090 INFO L495 AbstractCegarLoop]: Abstraction has 6714 states and 23324 transitions. [2022-11-20 10:58:07,091 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-20 10:58:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6714 states and 23324 transitions. [2022-11-20 10:58:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:58:07,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:07,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:58:07,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:58:07,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1178133706, now seen corresponding path program 1 times [2022-11-20 10:58:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:07,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571523711] [2022-11-20 10:58:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:07,490 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-20 10:58:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:07,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571523711] [2022-11-20 10:58:07,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571523711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:07,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:07,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:58:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226214769] [2022-11-20 10:58:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:07,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:07,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:07,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:07,494 INFO L87 Difference]: Start difference. First operand 6714 states and 23324 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-20 10:58:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:07,841 INFO L93 Difference]: Finished difference Result 6042 states and 20920 transitions. [2022-11-20 10:58:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:07,842 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-20 10:58:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:07,920 INFO L225 Difference]: With dead ends: 6042 [2022-11-20 10:58:07,920 INFO L226 Difference]: Without dead ends: 6042 [2022-11-20 10:58:07,926 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-20 10:58:07,927 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:07,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2022-11-20 10:58:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2022-11-20 10:58:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6042 states, 5728 states have (on average 3.6522346368715084) internal successors, (20920), 6041 states have internal predecessors, (20920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20920 transitions. [2022-11-20 10:58:08,191 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20920 transitions. Word has length 6 [2022-11-20 10:58:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:08,192 INFO L495 AbstractCegarLoop]: Abstraction has 6042 states and 20920 transitions. [2022-11-20 10:58:08,192 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-20 10:58:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20920 transitions. [2022-11-20 10:58:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:58:08,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:08,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:58:08,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2132559908, now seen corresponding path program 1 times [2022-11-20 10:58:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:08,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686251059] [2022-11-20 10:58:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:08,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-20 10:58:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:08,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686251059] [2022-11-20 10:58:08,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686251059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:08,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737428833] [2022-11-20 10:58:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:08,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:08,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:08,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:08,508 INFO L87 Difference]: Start difference. First operand 6042 states and 20920 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:08,847 INFO L93 Difference]: Finished difference Result 4686 states and 15335 transitions. [2022-11-20 10:58:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:08,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:58:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:08,898 INFO L225 Difference]: With dead ends: 4686 [2022-11-20 10:58:08,899 INFO L226 Difference]: Without dead ends: 4686 [2022-11-20 10:58:08,900 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-20 10:58:08,903 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:08,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 6 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2022-11-20 10:58:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4190. [2022-11-20 10:58:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4061 states have (on average 3.5427234671263235) internal successors, (14387), 4189 states have internal predecessors, (14387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 14387 transitions. [2022-11-20 10:58:09,066 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 14387 transitions. Word has length 7 [2022-11-20 10:58:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:09,067 INFO L495 AbstractCegarLoop]: Abstraction has 4190 states and 14387 transitions. [2022-11-20 10:58:09,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 14387 transitions. [2022-11-20 10:58:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:58:09,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:09,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:09,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:58:09,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2132559907, now seen corresponding path program 1 times [2022-11-20 10:58:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:09,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598082599] [2022-11-20 10:58:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:09,266 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-20 10:58:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:09,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598082599] [2022-11-20 10:58:09,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598082599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:09,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:09,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577805405] [2022-11-20 10:58:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:09,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:09,269 INFO L87 Difference]: Start difference. First operand 4190 states and 14387 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:09,377 INFO L93 Difference]: Finished difference Result 2002 states and 6406 transitions. [2022-11-20 10:58:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:58:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:09,386 INFO L225 Difference]: With dead ends: 2002 [2022-11-20 10:58:09,386 INFO L226 Difference]: Without dead ends: 1930 [2022-11-20 10:58:09,387 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-20 10:58:09,388 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:09,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-11-20 10:58:09,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2022-11-20 10:58:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1904 states have (on average 3.258403361344538) internal successors, (6204), 1929 states have internal predecessors, (6204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 6204 transitions. [2022-11-20 10:58:09,514 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 6204 transitions. Word has length 7 [2022-11-20 10:58:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:09,515 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 6204 transitions. [2022-11-20 10:58:09,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 6204 transitions. [2022-11-20 10:58:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:58:09,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:09,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:09,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:58:09,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash -662985833, now seen corresponding path program 1 times [2022-11-20 10:58:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854663847] [2022-11-20 10:58:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:09,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854663847] [2022-11-20 10:58:09,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854663847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:09,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:09,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:58:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031573688] [2022-11-20 10:58:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:09,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:09,616 INFO L87 Difference]: Start difference. First operand 1930 states and 6204 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:09,740 INFO L93 Difference]: Finished difference Result 1890 states and 6062 transitions. [2022-11-20 10:58:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:58:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:09,749 INFO L225 Difference]: With dead ends: 1890 [2022-11-20 10:58:09,749 INFO L226 Difference]: Without dead ends: 1890 [2022-11-20 10:58:09,750 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-20 10:58:09,751 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:09,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2022-11-20 10:58:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2022-11-20 10:58:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1864 states have (on average 3.2521459227467813) internal successors, (6062), 1889 states have internal predecessors, (6062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6062 transitions. [2022-11-20 10:58:09,808 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 6062 transitions. Word has length 9 [2022-11-20 10:58:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:09,808 INFO L495 AbstractCegarLoop]: Abstraction has 1890 states and 6062 transitions. [2022-11-20 10:58:09,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 6062 transitions. [2022-11-20 10:58:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:58:09,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:09,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:58:09,810 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 922272121, now seen corresponding path program 1 times [2022-11-20 10:58:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:09,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219945028] [2022-11-20 10:58:09,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219945028] [2022-11-20 10:58:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219945028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:58:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674307699] [2022-11-20 10:58:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:10,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:10,021 INFO L87 Difference]: Start difference. First operand 1890 states and 6062 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:10,157 INFO L93 Difference]: Finished difference Result 1865 states and 5972 transitions. [2022-11-20 10:58:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:10,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:58:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:10,166 INFO L225 Difference]: With dead ends: 1865 [2022-11-20 10:58:10,166 INFO L226 Difference]: Without dead ends: 1865 [2022-11-20 10:58:10,166 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-20 10:58:10,167 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:10,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2022-11-20 10:58:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1865. [2022-11-20 10:58:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1839 states have (on average 3.2474170744970094) internal successors, (5972), 1864 states have internal predecessors, (5972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 5972 transitions. [2022-11-20 10:58:10,221 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 5972 transitions. Word has length 10 [2022-11-20 10:58:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:10,221 INFO L495 AbstractCegarLoop]: Abstraction has 1865 states and 5972 transitions. [2022-11-20 10:58:10,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 5972 transitions. [2022-11-20 10:58:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:58:10,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:10,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:10,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:58:10,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 922275182, now seen corresponding path program 1 times [2022-11-20 10:58:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:10,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477660868] [2022-11-20 10:58:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:10,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:10,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477660868] [2022-11-20 10:58:10,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477660868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:10,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:10,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:10,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330773963] [2022-11-20 10:58:10,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:10,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:10,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:10,530 INFO L87 Difference]: Start difference. First operand 1865 states and 5972 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:10,723 INFO L93 Difference]: Finished difference Result 2017 states and 6342 transitions. [2022-11-20 10:58:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:10,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:58:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:10,733 INFO L225 Difference]: With dead ends: 2017 [2022-11-20 10:58:10,733 INFO L226 Difference]: Without dead ends: 2017 [2022-11-20 10:58:10,734 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-20 10:58:10,735 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:10,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2022-11-20 10:58:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1785. [2022-11-20 10:58:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1760 states have (on average 3.243181818181818) internal successors, (5708), 1784 states have internal predecessors, (5708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 5708 transitions. [2022-11-20 10:58:10,828 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 5708 transitions. Word has length 10 [2022-11-20 10:58:10,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:10,828 INFO L495 AbstractCegarLoop]: Abstraction has 1785 states and 5708 transitions. [2022-11-20 10:58:10,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 5708 transitions. [2022-11-20 10:58:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:58:10,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:10,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:58:10,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 922275183, now seen corresponding path program 1 times [2022-11-20 10:58:10,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:10,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661644418] [2022-11-20 10:58:10,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:11,317 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-20 10:58:11,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:11,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661644418] [2022-11-20 10:58:11,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661644418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:11,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:11,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:11,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993089081] [2022-11-20 10:58:11,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:11,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:11,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:11,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:11,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:11,321 INFO L87 Difference]: Start difference. First operand 1785 states and 5708 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:11,560 INFO L93 Difference]: Finished difference Result 2541 states and 8071 transitions. [2022-11-20 10:58:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:58:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:58:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:11,603 INFO L225 Difference]: With dead ends: 2541 [2022-11-20 10:58:11,603 INFO L226 Difference]: Without dead ends: 2541 [2022-11-20 10:58:11,603 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-20 10:58:11,604 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:11,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 9 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2022-11-20 10:58:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1849. [2022-11-20 10:58:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1824 states have (on average 3.2346491228070176) internal successors, (5900), 1848 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 5900 transitions. [2022-11-20 10:58:11,689 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 5900 transitions. Word has length 10 [2022-11-20 10:58:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:11,689 INFO L495 AbstractCegarLoop]: Abstraction has 1849 states and 5900 transitions. [2022-11-20 10:58:11,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 5900 transitions. [2022-11-20 10:58:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:58:11,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:11,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:11,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:58:11,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -987520250, now seen corresponding path program 1 times [2022-11-20 10:58:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:11,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946181156] [2022-11-20 10:58:11,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:11,917 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-20 10:58:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946181156] [2022-11-20 10:58:11,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946181156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:11,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:11,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249604202] [2022-11-20 10:58:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:11,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:11,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:11,921 INFO L87 Difference]: Start difference. First operand 1849 states and 5900 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:12,073 INFO L93 Difference]: Finished difference Result 2611 states and 8223 transitions. [2022-11-20 10:58:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:58:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:12,085 INFO L225 Difference]: With dead ends: 2611 [2022-11-20 10:58:12,086 INFO L226 Difference]: Without dead ends: 2611 [2022-11-20 10:58:12,086 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-20 10:58:12,087 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 60 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:12,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 4 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-11-20 10:58:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2008. [2022-11-20 10:58:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1983 states have (on average 3.231467473524962) internal successors, (6408), 2007 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 6408 transitions. [2022-11-20 10:58:12,147 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 6408 transitions. Word has length 11 [2022-11-20 10:58:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:12,147 INFO L495 AbstractCegarLoop]: Abstraction has 2008 states and 6408 transitions. [2022-11-20 10:58:12,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 6408 transitions. [2022-11-20 10:58:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:58:12,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:12,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:58:12,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash 537866640, now seen corresponding path program 1 times [2022-11-20 10:58:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:12,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044338635] [2022-11-20 10:58:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:12,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:12,550 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-20 10:58:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044338635] [2022-11-20 10:58:12,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044338635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:12,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:12,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095234327] [2022-11-20 10:58:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:12,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:58:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:12,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:58:12,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:58:12,553 INFO L87 Difference]: Start difference. First operand 2008 states and 6408 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:12,812 INFO L93 Difference]: Finished difference Result 1928 states and 6117 transitions. [2022-11-20 10:58:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:58:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 10:58:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:12,820 INFO L225 Difference]: With dead ends: 1928 [2022-11-20 10:58:12,820 INFO L226 Difference]: Without dead ends: 1928 [2022-11-20 10:58:12,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:58:12,821 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 89 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:12,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 7 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-11-20 10:58:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1778. [2022-11-20 10:58:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1754 states have (on average 3.2217787913340934) internal successors, (5651), 1777 states have internal predecessors, (5651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 5651 transitions. [2022-11-20 10:58:12,871 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 5651 transitions. Word has length 12 [2022-11-20 10:58:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:12,872 INFO L495 AbstractCegarLoop]: Abstraction has 1778 states and 5651 transitions. [2022-11-20 10:58:12,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 5651 transitions. [2022-11-20 10:58:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:58:12,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:12,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:12,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:58:12,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1540252580, now seen corresponding path program 1 times [2022-11-20 10:58:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:12,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051739152] [2022-11-20 10:58:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:13,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-20 10:58:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:13,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051739152] [2022-11-20 10:58:13,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051739152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:13,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:13,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351380419] [2022-11-20 10:58:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:13,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:58:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:58:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:58:13,072 INFO L87 Difference]: Start difference. First operand 1778 states and 5651 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:13,245 INFO L93 Difference]: Finished difference Result 1798 states and 5494 transitions. [2022-11-20 10:58:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:13,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 10:58:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:13,253 INFO L225 Difference]: With dead ends: 1798 [2022-11-20 10:58:13,253 INFO L226 Difference]: Without dead ends: 1798 [2022-11-20 10:58:13,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:58:13,254 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 58 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:13,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 10 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2022-11-20 10:58:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1574. [2022-11-20 10:58:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1550 states have (on average 3.190967741935484) internal successors, (4946), 1573 states have internal predecessors, (4946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 4946 transitions. [2022-11-20 10:58:13,302 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 4946 transitions. Word has length 12 [2022-11-20 10:58:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:13,302 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 4946 transitions. [2022-11-20 10:58:13,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 4946 transitions. [2022-11-20 10:58:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:58:13,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:13,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:58:13,304 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash 503192314, now seen corresponding path program 1 times [2022-11-20 10:58:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:13,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385792680] [2022-11-20 10:58:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:13,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-20 10:58:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:13,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385792680] [2022-11-20 10:58:13,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385792680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:13,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:13,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:58:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085233377] [2022-11-20 10:58:13,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:13,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:58:13,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:13,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:58:13,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:58:13,801 INFO L87 Difference]: Start difference. First operand 1574 states and 4946 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:14,226 INFO L93 Difference]: Finished difference Result 1270 states and 3906 transitions. [2022-11-20 10:58:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:58:14,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:58:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:14,232 INFO L225 Difference]: With dead ends: 1270 [2022-11-20 10:58:14,232 INFO L226 Difference]: Without dead ends: 1186 [2022-11-20 10:58:14,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:58:14,233 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:14,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 36 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:58:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-11-20 10:58:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2022-11-20 10:58:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1174 states have (on average 3.0477001703577513) internal successors, (3578), 1185 states have internal predecessors, (3578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 3578 transitions. [2022-11-20 10:58:14,273 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 3578 transitions. Word has length 13 [2022-11-20 10:58:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:14,273 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 3578 transitions. [2022-11-20 10:58:14,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 3578 transitions. [2022-11-20 10:58:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:58:14,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:14,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:14,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:58:14,276 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash 503192225, now seen corresponding path program 1 times [2022-11-20 10:58:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:14,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276764155] [2022-11-20 10:58:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:14,590 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-20 10:58:14,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:14,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276764155] [2022-11-20 10:58:14,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276764155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:14,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:14,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:58:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874358110] [2022-11-20 10:58:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:14,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:58:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:14,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:58:14,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:58:14,593 INFO L87 Difference]: Start difference. First operand 1186 states and 3578 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:14,780 INFO L93 Difference]: Finished difference Result 1094 states and 3169 transitions. [2022-11-20 10:58:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:58:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:58:14,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:14,785 INFO L225 Difference]: With dead ends: 1094 [2022-11-20 10:58:14,785 INFO L226 Difference]: Without dead ends: 1094 [2022-11-20 10:58:14,785 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-20 10:58:14,786 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:14,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-11-20 10:58:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 982. [2022-11-20 10:58:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 970 states have (on average 2.9783505154639176) internal successors, (2889), 981 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2889 transitions. [2022-11-20 10:58:14,818 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2889 transitions. Word has length 13 [2022-11-20 10:58:14,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:14,819 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 2889 transitions. [2022-11-20 10:58:14,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2889 transitions. [2022-11-20 10:58:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:58:14,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:14,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:14,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:58:14,822 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:14,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 500370272, now seen corresponding path program 1 times [2022-11-20 10:58:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:14,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107721773] [2022-11-20 10:58:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:14,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:58:16,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:16,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107721773] [2022-11-20 10:58:16,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107721773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:16,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:16,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:58:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58815736] [2022-11-20 10:58:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:16,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:58:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:58:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:58:16,068 INFO L87 Difference]: Start difference. First operand 982 states and 2889 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:16,530 INFO L93 Difference]: Finished difference Result 1207 states and 3519 transitions. [2022-11-20 10:58:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:58:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 10:58:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:16,535 INFO L225 Difference]: With dead ends: 1207 [2022-11-20 10:58:16,535 INFO L226 Difference]: Without dead ends: 1207 [2022-11-20 10:58:16,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:58:16,536 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:16,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 21 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:58:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2022-11-20 10:58:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 977. [2022-11-20 10:58:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 965 states have (on average 2.978238341968912) internal successors, (2874), 976 states have internal predecessors, (2874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2874 transitions. [2022-11-20 10:58:16,562 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2874 transitions. Word has length 13 [2022-11-20 10:58:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:16,562 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 2874 transitions. [2022-11-20 10:58:16,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2874 transitions. [2022-11-20 10:58:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:58:16,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:16,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:16,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:58:16,565 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1580905538, now seen corresponding path program 1 times [2022-11-20 10:58:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:16,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582696709] [2022-11-20 10:58:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:16,651 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-20 10:58:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582696709] [2022-11-20 10:58:16,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582696709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:16,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:16,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112724922] [2022-11-20 10:58:16,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:16,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:16,654 INFO L87 Difference]: Start difference. First operand 977 states and 2874 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-20 10:58:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:16,745 INFO L93 Difference]: Finished difference Result 989 states and 3007 transitions. [2022-11-20 10:58:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:16,746 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-20 10:58:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:16,747 INFO L225 Difference]: With dead ends: 989 [2022-11-20 10:58:16,748 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 10:58:16,748 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-20 10:58:16,749 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:16,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 10:58:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-11-20 10:58:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 2.746268656716418) internal successors, (736), 268 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 736 transitions. [2022-11-20 10:58:16,756 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 736 transitions. Word has length 14 [2022-11-20 10:58:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:16,756 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 736 transitions. [2022-11-20 10:58:16,757 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-20 10:58:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 736 transitions. [2022-11-20 10:58:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:58:16,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:16,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:16,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:58:16,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1031723105, now seen corresponding path program 1 times [2022-11-20 10:58:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:16,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430039413] [2022-11-20 10:58:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:16,966 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-20 10:58:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:16,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430039413] [2022-11-20 10:58:16,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430039413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:16,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:16,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282847947] [2022-11-20 10:58:16,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:16,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:16,976 INFO L87 Difference]: Start difference. First operand 269 states and 736 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-20 10:58:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:17,043 INFO L93 Difference]: Finished difference Result 190 states and 444 transitions. [2022-11-20 10:58:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-20 10:58:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:17,044 INFO L225 Difference]: With dead ends: 190 [2022-11-20 10:58:17,044 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 10:58:17,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:17,045 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:17,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 10:58:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-20 10:58:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.3492063492063493) internal successors, (444), 189 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 444 transitions. [2022-11-20 10:58:17,050 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 444 transitions. Word has length 15 [2022-11-20 10:58:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:17,050 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 444 transitions. [2022-11-20 10:58:17,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-20 10:58:17,050 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 444 transitions. [2022-11-20 10:58:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:58:17,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:17,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:17,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:58:17,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2108428157, now seen corresponding path program 1 times [2022-11-20 10:58:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:17,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063474434] [2022-11-20 10:58:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:17,317 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-20 10:58:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063474434] [2022-11-20 10:58:17,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063474434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:17,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:17,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272048371] [2022-11-20 10:58:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:17,320 INFO L87 Difference]: Start difference. First operand 190 states and 444 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:17,401 INFO L93 Difference]: Finished difference Result 117 states and 234 transitions. [2022-11-20 10:58:17,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:58:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:17,402 INFO L225 Difference]: With dead ends: 117 [2022-11-20 10:58:17,402 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 10:58:17,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:17,403 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:17,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:17,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 10:58:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-20 10:58:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.0172413793103448) internal successors, (234), 116 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 234 transitions. [2022-11-20 10:58:17,406 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 234 transitions. Word has length 17 [2022-11-20 10:58:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:17,406 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 234 transitions. [2022-11-20 10:58:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 234 transitions. [2022-11-20 10:58:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 10:58:17,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:17,408 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-20 10:58:17,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:58:17,408 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash 533635552, now seen corresponding path program 1 times [2022-11-20 10:58:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:17,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024248133] [2022-11-20 10:58:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:17,726 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-20 10:58:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024248133] [2022-11-20 10:58:17,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024248133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:17,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:17,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:58:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754322529] [2022-11-20 10:58:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:17,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:58:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:58:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:58:17,729 INFO L87 Difference]: Start difference. First operand 117 states and 234 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:17,812 INFO L93 Difference]: Finished difference Result 92 states and 185 transitions. [2022-11-20 10:58:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:58:17,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 10:58:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:17,813 INFO L225 Difference]: With dead ends: 92 [2022-11-20 10:58:17,813 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 10:58:17,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:58:17,814 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:17,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 10:58:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 10:58:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2022-11-20 10:58:17,816 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 19 [2022-11-20 10:58:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:17,817 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2022-11-20 10:58:17,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2022-11-20 10:58:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:58:17,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:17,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:17,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:58:17,818 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:17,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1547011432, now seen corresponding path program 1 times [2022-11-20 10:58:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:17,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211494522] [2022-11-20 10:58:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:18,046 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-20 10:58:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:58:18,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211494522] [2022-11-20 10:58:18,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211494522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:18,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:18,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028904500] [2022-11-20 10:58:18,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:18,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:58:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:18,049 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:18,146 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2022-11-20 10:58:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:18,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 10:58:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:18,147 INFO L225 Difference]: With dead ends: 118 [2022-11-20 10:58:18,148 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 10:58:18,148 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-20 10:58:18,148 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:18,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 10:58:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-20 10:58:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2022-11-20 10:58:18,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2022-11-20 10:58:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:18,150 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2022-11-20 10:58:18,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2022-11-20 10:58:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:58:18,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:18,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:18,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:58:18,152 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:58:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1606634434, now seen corresponding path program 2 times [2022-11-20 10:58:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:58:18,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601450123] [2022-11-20 10:58:18,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:58:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:18,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:58:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:18,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:58:18,443 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:58:18,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining) [2022-11-20 10:58:18,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining) [2022-11-20 10:58:18,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2022-11-20 10:58:18,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2022-11-20 10:58:18,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2022-11-20 10:58:18,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2022-11-20 10:58:18,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2022-11-20 10:58:18,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2022-11-20 10:58:18,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2022-11-20 10:58:18,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2022-11-20 10:58:18,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2022-11-20 10:58:18,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2022-11-20 10:58:18,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2022-11-20 10:58:18,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2022-11-20 10:58:18,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2022-11-20 10:58:18,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2022-11-20 10:58:18,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2022-11-20 10:58:18,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2022-11-20 10:58:18,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2022-11-20 10:58:18,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2022-11-20 10:58:18,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2022-11-20 10:58:18,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2022-11-20 10:58:18,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2022-11-20 10:58:18,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2022-11-20 10:58:18,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2022-11-20 10:58:18,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2022-11-20 10:58:18,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2022-11-20 10:58:18,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2022-11-20 10:58:18,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2022-11-20 10:58:18,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2022-11-20 10:58:18,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2022-11-20 10:58:18,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2022-11-20 10:58:18,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2022-11-20 10:58:18,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2022-11-20 10:58:18,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2022-11-20 10:58:18,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2022-11-20 10:58:18,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2022-11-20 10:58:18,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2022-11-20 10:58:18,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining) [2022-11-20 10:58:18,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining) [2022-11-20 10:58:18,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining) [2022-11-20 10:58:18,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining) [2022-11-20 10:58:18,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining) [2022-11-20 10:58:18,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2022-11-20 10:58:18,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2022-11-20 10:58:18,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2022-11-20 10:58:18,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2022-11-20 10:58:18,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2022-11-20 10:58:18,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2022-11-20 10:58:18,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2022-11-20 10:58:18,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2022-11-20 10:58:18,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2022-11-20 10:58:18,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2022-11-20 10:58:18,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2022-11-20 10:58:18,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2022-11-20 10:58:18,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2022-11-20 10:58:18,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2022-11-20 10:58:18,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2022-11-20 10:58:18,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2022-11-20 10:58:18,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2022-11-20 10:58:18,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2022-11-20 10:58:18,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2022-11-20 10:58:18,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2022-11-20 10:58:18,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2022-11-20 10:58:18,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2022-11-20 10:58:18,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2022-11-20 10:58:18,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2022-11-20 10:58:18,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:58:18,467 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:18,475 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:58:18,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:58:18,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:58:18 BasicIcfg [2022-11-20 10:58:18,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:58:18,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:58:18,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:58:18,608 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:58:18,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:45" (3/4) ... [2022-11-20 10:58:18,612 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:58:18,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:58:18,613 INFO L158 Benchmark]: Toolchain (without parser) took 35149.36ms. Allocated memory was 159.4MB in the beginning and 635.4MB in the end (delta: 476.1MB). Free memory was 113.7MB in the beginning and 272.4MB in the end (delta: -158.7MB). Peak memory consumption was 318.6MB. Max. memory is 16.1GB. [2022-11-20 10:58:18,613 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory was 102.1MB in the beginning and 101.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:18,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.36ms. Allocated memory is still 159.4MB. Free memory was 113.7MB in the beginning and 89.7MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:18,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.41ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 87.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:18,614 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 84.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:18,615 INFO L158 Benchmark]: RCFGBuilder took 1705.12ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 84.4MB in the beginning and 124.0MB in the end (delta: -39.6MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2022-11-20 10:58:18,616 INFO L158 Benchmark]: TraceAbstraction took 32710.27ms. Allocated memory was 192.9MB in the beginning and 635.4MB in the end (delta: 442.5MB). Free memory was 124.0MB in the beginning and 273.4MB in the end (delta: -149.4MB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:18,616 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 635.4MB. Free memory was 273.4MB in the beginning and 272.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:18,621 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.28ms. Allocated memory is still 159.4MB. Free memory was 102.1MB in the beginning and 101.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.36ms. Allocated memory is still 159.4MB. Free memory was 113.7MB in the beginning and 89.7MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.41ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 87.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.06ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 84.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1705.12ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 84.4MB in the beginning and 124.0MB in the end (delta: -39.6MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32710.27ms. Allocated memory was 192.9MB in the beginning and 635.4MB in the end (delta: 442.5MB). Free memory was 124.0MB in the beginning and 273.4MB in the end (delta: -149.4MB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 635.4MB. Free memory was 273.4MB in the beginning and 272.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.2s, 182 PlacesBefore, 76 PlacesAfterwards, 174 TransitionsBefore, 66 TransitionsAfterwards, 5328 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 153 TotalNumberOfCompositions, 23452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10314, independent: 9833, independent conditional: 0, independent unconditional: 9833, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3317, independent: 3233, independent conditional: 0, independent unconditional: 3233, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3317, independent: 3035, independent conditional: 0, independent unconditional: 3035, dependent: 282, dependent conditional: 0, dependent unconditional: 282, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 282, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1819, independent: 1090, independent conditional: 0, independent unconditional: 1090, dependent: 647, dependent conditional: 0, dependent unconditional: 647, unknown: 82, unknown conditional: 0, unknown unconditional: 82] ], Cache Queries: [ total: 10314, independent: 6600, independent conditional: 0, independent unconditional: 6600, dependent: 370, dependent conditional: 0, dependent unconditional: 370, unknown: 3344, unknown conditional: 0, unknown unconditional: 3344] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 724, Positive conditional cache size: 0, Positive unconditional cache size: 724, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=-2, t2052={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=-1, t2052={7:0}, t2053={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; 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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t2054, ((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_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$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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 3 z = 1 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L765] 1 __unbuffered_p0_EBX = x 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L777] 2 x = 1 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_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_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$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, 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=0, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 224 locations, 67 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 784 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1583 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 51 mSDtfsCounter, 1583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15204occurred in iteration=0, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 2739 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-20 10:58:18,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN --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 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- 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-6b4ec56 [2022-11-20 10:58:21,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:58:21,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:58:21,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:58:21,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:58:21,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:58:21,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:58:21,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:58:21,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:58:21,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:58:21,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:58:21,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:58:21,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:58:21,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:58:21,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:58:21,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:58:21,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:58:21,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:58:21,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:58:21,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:58:21,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:58:21,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:58:21,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:58:21,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:58:21,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:58:21,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:58:21,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:58:21,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:58:21,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:58:21,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:58:21,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:58:21,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:58:21,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:58:21,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:58:21,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:58:21,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:58:21,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:58:21,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:58:21,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:58:21,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:58:21,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:58:21,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 10:58:21,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:58:21,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:58:21,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:58:21,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:58:21,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:58:21,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:58:21,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:58:21,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:58:21,267 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:58:21,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:58:21,269 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:58:21,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:58:21,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:58:21,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:58:21,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:58:21,270 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:58:21,270 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:58:21,271 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:58:21,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:58:21,271 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:58:21,271 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:58:21,272 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:58:21,272 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:58:21,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:58:21,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:58:21,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:58:21,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:58:21,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:58:21,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:58:21,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:58:21,274 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:58:21,274 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:58:21,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:58:21,275 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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2022-11-20 10:58:21,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:58:21,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:58:21,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:58:21,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:58:21,712 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:58:21,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-20 10:58:25,057 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:58:25,349 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:58:25,349 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-20 10:58:25,377 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data/2d47d32e9/ac5e9fa2d1d44558a1421732d183255f/FLAG1f9279b48 [2022-11-20 10:58:25,426 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/data/2d47d32e9/ac5e9fa2d1d44558a1421732d183255f [2022-11-20 10:58:25,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:58:25,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:58:25,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:58:25,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:58:25,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:58:25,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:25" (1/1) ... [2022-11-20 10:58:25,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51862aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:25, skipping insertion in model container [2022-11-20 10:58:25,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:25" (1/1) ... [2022-11-20 10:58:25,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:58:25,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:58:25,707 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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-20 10:58:25,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:58:25,974 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:58:25,992 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_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-20 10:58:26,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:58:26,123 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:58:26,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26 WrapperNode [2022-11-20 10:58:26,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:58:26,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:58:26,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:58:26,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:58:26,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,215 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2022-11-20 10:58:26,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:58:26,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:58:26,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:58:26,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:58:26,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,279 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:58:26,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:58:26,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:58:26,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:58:26,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (1/1) ... [2022-11-20 10:58:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:58:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:26,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:58:26,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:58:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 10:58:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:58:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:58:26,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:58:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:58:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:58:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:58:26,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 10:58:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:58:26,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:58:26,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:58:26,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:58:26,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:58:26,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:58:26,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:58:26,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:58:26,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:58:26,385 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:58:26,647 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:58:26,649 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:58:27,301 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:58:28,016 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:58:28,017 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:58:28,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:28 BoogieIcfgContainer [2022-11-20 10:58:28,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:58:28,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:58:28,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:58:28,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:58:28,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:58:25" (1/3) ... [2022-11-20 10:58:28,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b02ef2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:28, skipping insertion in model container [2022-11-20 10:58:28,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:26" (2/3) ... [2022-11-20 10:58:28,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b02ef2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:28, skipping insertion in model container [2022-11-20 10:58:28,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:28" (3/3) ... [2022-11-20 10:58:28,030 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-11-20 10:58:28,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:58:28,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-20 10:58:28,051 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:58:28,242 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:58:28,291 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:58:28,323 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 175 transitions, 365 flow [2022-11-20 10:58:28,328 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 175 transitions, 365 flow [2022-11-20 10:58:28,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 175 transitions, 365 flow [2022-11-20 10:58:28,445 INFO L130 PetriNetUnfolder]: 2/172 cut-off events. [2022-11-20 10:58:28,447 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:58:28,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 2/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 219 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-11-20 10:58:28,459 INFO L119 LiptonReduction]: Number of co-enabled transitions 5328 [2022-11-20 10:59:13,059 INFO L134 LiptonReduction]: Checked pairs total: 21300 [2022-11-20 10:59:13,060 INFO L136 LiptonReduction]: Total number of compositions: 154 [2022-11-20 10:59:13,072 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 66 transitions, 147 flow [2022-11-20 10:59:13,749 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:13,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:59:13,779 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;@60829603, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:59:13,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-11-20 10:59:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:59:13,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:13,829 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:59:13,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1065, now seen corresponding path program 1 times [2022-11-20 10:59:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:13,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388543709] [2022-11-20 10:59:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:13,854 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-20 10:59:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:13,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:13,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:59:14,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:14,067 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-20 10:59:14,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:14,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:14,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388543709] [2022-11-20 10:59:14,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388543709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:14,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:14,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:59:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856487206] [2022-11-20 10:59:14,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:14,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:59:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:14,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:59:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:59:14,123 INFO L87 Difference]: Start difference. First operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 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-20 10:59:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:14,518 INFO L93 Difference]: Finished difference Result 6714 states and 23324 transitions. [2022-11-20 10:59:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:59:14,521 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-20 10:59:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:14,751 INFO L225 Difference]: With dead ends: 6714 [2022-11-20 10:59:14,751 INFO L226 Difference]: Without dead ends: 6714 [2022-11-20 10:59:14,752 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-20 10:59:14,758 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:14,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:59:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2022-11-20 10:59:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 6714. [2022-11-20 10:59:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6714 states, 6337 states have (on average 3.68060596496765) internal successors, (23324), 6713 states have internal predecessors, (23324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6714 states to 6714 states and 23324 transitions. [2022-11-20 10:59:15,336 INFO L78 Accepts]: Start accepts. Automaton has 6714 states and 23324 transitions. Word has length 1 [2022-11-20 10:59:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:15,337 INFO L495 AbstractCegarLoop]: Abstraction has 6714 states and 23324 transitions. [2022-11-20 10:59:15,337 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-20 10:59:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6714 states and 23324 transitions. [2022-11-20 10:59:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:59:15,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:15,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:59:15,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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)] Ended with exit code 0 [2022-11-20 10:59:15,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:15,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:15,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1237330378, now seen corresponding path program 1 times [2022-11-20 10:59:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:15,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565233626] [2022-11-20 10:59:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:15,553 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-20 10:59:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:15,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:15,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:15,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:59:15,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:15,893 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-20 10:59:15,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:15,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565233626] [2022-11-20 10:59:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565233626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:15,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:15,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:59:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907481268] [2022-11-20 10:59:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:59:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:59:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:15,897 INFO L87 Difference]: Start difference. First operand 6714 states and 23324 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-20 10:59:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:16,606 INFO L93 Difference]: Finished difference Result 6042 states and 20920 transitions. [2022-11-20 10:59:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:59:16,607 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-20 10:59:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:16,680 INFO L225 Difference]: With dead ends: 6042 [2022-11-20 10:59:16,680 INFO L226 Difference]: Without dead ends: 6042 [2022-11-20 10:59:16,680 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-20 10:59:16,682 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:16,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:59:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2022-11-20 10:59:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2022-11-20 10:59:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6042 states, 5728 states have (on average 3.6522346368715084) internal successors, (20920), 6041 states have internal predecessors, (20920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20920 transitions. [2022-11-20 10:59:17,054 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20920 transitions. Word has length 6 [2022-11-20 10:59:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:17,054 INFO L495 AbstractCegarLoop]: Abstraction has 6042 states and 20920 transitions. [2022-11-20 10:59:17,055 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-20 10:59:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20920 transitions. [2022-11-20 10:59:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:59:17,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:17,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:59:17,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-20 10:59:17,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:17,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash -297463074, now seen corresponding path program 1 times [2022-11-20 10:59:17,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:17,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320331908] [2022-11-20 10:59:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:17,270 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-20 10:59:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:17,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:17,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:59:17,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:17,555 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-20 10:59:17,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:17,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320331908] [2022-11-20 10:59:17,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320331908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:17,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:17,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:59:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651609892] [2022-11-20 10:59:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:59:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:59:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:17,559 INFO L87 Difference]: Start difference. First operand 6042 states and 20920 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:18,140 INFO L93 Difference]: Finished difference Result 7638 states and 26489 transitions. [2022-11-20 10:59:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:59:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:59:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:18,208 INFO L225 Difference]: With dead ends: 7638 [2022-11-20 10:59:18,208 INFO L226 Difference]: Without dead ends: 7638 [2022-11-20 10:59:18,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:18,212 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:18,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:59:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2022-11-20 10:59:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 6462. [2022-11-20 10:59:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6462 states, 6164 states have (on average 3.814243997404283) internal successors, (23511), 6461 states have internal predecessors, (23511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 23511 transitions. [2022-11-20 10:59:18,584 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 23511 transitions. Word has length 7 [2022-11-20 10:59:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:18,585 INFO L495 AbstractCegarLoop]: Abstraction has 6462 states and 23511 transitions. [2022-11-20 10:59:18,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 23511 transitions. [2022-11-20 10:59:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:59:18,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:18,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:59:18,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:18,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:18,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash -297463072, now seen corresponding path program 1 times [2022-11-20 10:59:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:18,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135471737] [2022-11-20 10:59:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:18,803 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-20 10:59:18,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:18,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:18,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:19,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:59:19,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:19,085 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 10:59:19,086 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-20 10:59:19,136 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:59:19,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 10:59:19,170 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-20 10:59:19,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:19,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:19,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135471737] [2022-11-20 10:59:19,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135471737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:19,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:19,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:59:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249424642] [2022-11-20 10:59:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:19,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:59:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:59:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:19,173 INFO L87 Difference]: Start difference. First operand 6462 states and 23511 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:19,479 INFO L93 Difference]: Finished difference Result 4066 states and 14358 transitions. [2022-11-20 10:59:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:59:19,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:59:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:19,580 INFO L225 Difference]: With dead ends: 4066 [2022-11-20 10:59:19,584 INFO L226 Difference]: Without dead ends: 4066 [2022-11-20 10:59:19,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:19,585 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:19,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:59:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2022-11-20 10:59:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 4066. [2022-11-20 10:59:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4066 states, 3939 states have (on average 3.645087585681645) internal successors, (14358), 4065 states have internal predecessors, (14358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 14358 transitions. [2022-11-20 10:59:19,730 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 14358 transitions. Word has length 7 [2022-11-20 10:59:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:19,731 INFO L495 AbstractCegarLoop]: Abstraction has 4066 states and 14358 transitions. [2022-11-20 10:59:19,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 14358 transitions. [2022-11-20 10:59:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:59:19,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:19,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:59:19,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:19,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:19,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash -297463071, now seen corresponding path program 1 times [2022-11-20 10:59:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:19,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565777433] [2022-11-20 10:59:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:19,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:59:19,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:19,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:19,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:20,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:59:20,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:20,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:59:20,178 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-20 10:59:20,240 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:59:20,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 10:59:20,285 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-20 10:59:20,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:20,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:20,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565777433] [2022-11-20 10:59:20,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565777433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:20,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:20,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:59:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715801706] [2022-11-20 10:59:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:20,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:59:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:59:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:20,288 INFO L87 Difference]: Start difference. First operand 4066 states and 14358 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:20,538 INFO L93 Difference]: Finished difference Result 1910 states and 6361 transitions. [2022-11-20 10:59:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:59:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:59:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:20,550 INFO L225 Difference]: With dead ends: 1910 [2022-11-20 10:59:20,550 INFO L226 Difference]: Without dead ends: 1910 [2022-11-20 10:59:20,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:20,551 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:20,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:59:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2022-11-20 10:59:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1818. [2022-11-20 10:59:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1792 states have (on average 3.3839285714285716) internal successors, (6064), 1817 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 6064 transitions. [2022-11-20 10:59:20,622 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 6064 transitions. Word has length 7 [2022-11-20 10:59:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:20,623 INFO L495 AbstractCegarLoop]: Abstraction has 1818 states and 6064 transitions. [2022-11-20 10:59:20,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 6064 transitions. [2022-11-20 10:59:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:59:20,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:20,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:59:20,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:20,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:20,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1929403834, now seen corresponding path program 1 times [2022-11-20 10:59:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:20,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312830056] [2022-11-20 10:59:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:20,838 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-20 10:59:20,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:20,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:20,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:21,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:59:21,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:21,119 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-20 10:59:21,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:21,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:21,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312830056] [2022-11-20 10:59:21,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312830056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:21,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:21,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:59:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423279966] [2022-11-20 10:59:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:21,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:59:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:59:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:59:21,123 INFO L87 Difference]: Start difference. First operand 1818 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:21,328 INFO L93 Difference]: Finished difference Result 921 states and 2488 transitions. [2022-11-20 10:59:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:59:21,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:59:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:21,338 INFO L225 Difference]: With dead ends: 921 [2022-11-20 10:59:21,338 INFO L226 Difference]: Without dead ends: 921 [2022-11-20 10:59:21,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-20 10:59:21,339 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:21,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:59:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-11-20 10:59:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-11-20 10:59:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 895 states have (on average 2.7798882681564248) internal successors, (2488), 920 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 2488 transitions. [2022-11-20 10:59:21,371 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 2488 transitions. Word has length 9 [2022-11-20 10:59:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:21,371 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 2488 transitions. [2022-11-20 10:59:21,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 2488 transitions. [2022-11-20 10:59:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:59:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:21,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:59:21,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:21,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:21,590 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1268747857, now seen corresponding path program 1 times [2022-11-20 10:59:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:21,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346938090] [2022-11-20 10:59:21,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:21,592 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-20 10:59:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:21,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:21,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:21,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:59:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:21,833 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-20 10:59:21,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:21,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:21,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346938090] [2022-11-20 10:59:21,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346938090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:21,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:21,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:59:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309679558] [2022-11-20 10:59:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:21,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:59:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:21,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:59:21,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:59:21,837 INFO L87 Difference]: Start difference. First operand 921 states and 2488 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:22,101 INFO L93 Difference]: Finished difference Result 310 states and 671 transitions. [2022-11-20 10:59:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:59:22,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 10:59:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:22,103 INFO L225 Difference]: With dead ends: 310 [2022-11-20 10:59:22,104 INFO L226 Difference]: Without dead ends: 310 [2022-11-20 10:59:22,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:59:22,104 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:22,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:59:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-20 10:59:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-11-20 10:59:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 296 states have (on average 2.266891891891892) internal successors, (671), 309 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 671 transitions. [2022-11-20 10:59:22,114 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 671 transitions. Word has length 12 [2022-11-20 10:59:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:22,115 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 671 transitions. [2022-11-20 10:59:22,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 671 transitions. [2022-11-20 10:59:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:59:22,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:22,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:59:22,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:22,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:22,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:22,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1141358996, now seen corresponding path program 1 times [2022-11-20 10:59:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:22,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16106753] [2022-11-20 10:59:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:22,332 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-20 10:59:22,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:22,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:22,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:22,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:59:22,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:22,614 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-20 10:59:22,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:22,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:59:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16106753] [2022-11-20 10:59:22,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16106753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:22,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:22,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:59:22,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798552220] [2022-11-20 10:59:22,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:22,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:59:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:59:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:59:22,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:59:22,618 INFO L87 Difference]: Start difference. First operand 310 states and 671 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:23,010 INFO L93 Difference]: Finished difference Result 179 states and 413 transitions. [2022-11-20 10:59:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:59:23,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 10:59:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:23,012 INFO L225 Difference]: With dead ends: 179 [2022-11-20 10:59:23,012 INFO L226 Difference]: Without dead ends: 179 [2022-11-20 10:59:23,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:59:23,012 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:23,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:59:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-20 10:59:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-11-20 10:59:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 175 states have (on average 2.36) internal successors, (413), 178 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 413 transitions. [2022-11-20 10:59:23,019 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 413 transitions. Word has length 16 [2022-11-20 10:59:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:23,019 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 413 transitions. [2022-11-20 10:59:23,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:59:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 413 transitions. [2022-11-20 10:59:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 10:59:23,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:23,021 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-20 10:59:23,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:23,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:23,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 10:59:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1643238644, now seen corresponding path program 1 times [2022-11-20 10:59:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:59:23,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878103836] [2022-11-20 10:59:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:23,237 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-20 10:59:23,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:59:23,238 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:23,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 10:59:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:23,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:59:23,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:23,600 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-20 11:00:05,278 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 44 treesize of output 28 [2022-11-20 11:00:05,287 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-20 11:00:05,319 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-20 11:00:05,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:00:05,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:00:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878103836] [2022-11-20 11:00:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878103836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:05,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:05,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505707831] [2022-11-20 11:00:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:05,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:00:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:00:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:00:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:00:05,321 INFO L87 Difference]: Start difference. First operand 179 states and 413 transitions. Second operand has 5 states, 4 states have (on average 5.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-20 11:00:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:05,792 INFO L93 Difference]: Finished difference Result 231 states and 522 transitions. [2022-11-20 11:00:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:00:05,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.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-20 11:00:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:05,794 INFO L225 Difference]: With dead ends: 231 [2022-11-20 11:00:05,794 INFO L226 Difference]: Without dead ends: 231 [2022-11-20 11:00:05,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:00:05,795 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:05,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 16 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:00:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-20 11:00:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 178. [2022-11-20 11:00:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 2.354285714285714) internal successors, (412), 177 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 412 transitions. [2022-11-20 11:00:05,800 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 412 transitions. Word has length 20 [2022-11-20 11:00:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:05,800 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 412 transitions. [2022-11-20 11:00:05,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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-20 11:00:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 412 transitions. [2022-11-20 11:00:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:00:05,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:05,801 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-20 11:00:05,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:06,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:06,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 11:00:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1643238643, now seen corresponding path program 1 times [2022-11-20 11:00:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:00:06,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197897196] [2022-11-20 11:00:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:06,014 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-20 11:00:06,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:00:06,014 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:06,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:06,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:00:06,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:06,343 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-20 11:00:12,824 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-20 11:00:12,845 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 54 treesize of output 38 [2022-11-20 11:00:13,036 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-20 11:00:13,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:00:13,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:00:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197897196] [2022-11-20 11:00:13,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197897196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:13,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:13,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139101194] [2022-11-20 11:00:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:00:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:00:13,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:00:13,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:00:13,039 INFO L87 Difference]: Start difference. First operand 178 states and 412 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-20 11:00:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:13,418 INFO L93 Difference]: Finished difference Result 229 states and 520 transitions. [2022-11-20 11:00:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:00:13,419 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-20 11:00:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:13,420 INFO L225 Difference]: With dead ends: 229 [2022-11-20 11:00:13,420 INFO L226 Difference]: Without dead ends: 229 [2022-11-20 11:00:13,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:00:13,421 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:13,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 16 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:00:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-20 11:00:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 177. [2022-11-20 11:00:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 2.3485714285714288) internal successors, (411), 176 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 411 transitions. [2022-11-20 11:00:13,427 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 411 transitions. Word has length 20 [2022-11-20 11:00:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:13,427 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 411 transitions. [2022-11-20 11:00:13,427 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-20 11:00:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 411 transitions. [2022-11-20 11:00:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:00:13,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:13,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:13,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:13,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:13,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 11:00:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 599206050, now seen corresponding path program 1 times [2022-11-20 11:00:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:00:13,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619808797] [2022-11-20 11:00:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:13,643 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-20 11:00:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:00:13,645 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:13,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:13,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:00:13,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:13,935 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-20 11:00:13,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:00:13,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:00:13,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619808797] [2022-11-20 11:00:13,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619808797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:13,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:13,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:00:13,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303790597] [2022-11-20 11:00:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:13,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:13,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:00:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:13,937 INFO L87 Difference]: Start difference. First operand 177 states and 411 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:14,085 INFO L93 Difference]: Finished difference Result 228 states and 513 transitions. [2022-11-20 11:00:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:00:14,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:00:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:14,087 INFO L225 Difference]: With dead ends: 228 [2022-11-20 11:00:14,087 INFO L226 Difference]: Without dead ends: 228 [2022-11-20 11:00:14,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:00:14,087 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:14,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:00:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-20 11:00:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2022-11-20 11:00:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.2972972972972974) internal successors, (510), 223 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 510 transitions. [2022-11-20 11:00:14,093 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 510 transitions. Word has length 21 [2022-11-20 11:00:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:14,094 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 510 transitions. [2022-11-20 11:00:14,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 510 transitions. [2022-11-20 11:00:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:00:14,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:14,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:14,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:14,308 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 11:00:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1610227096, now seen corresponding path program 2 times [2022-11-20 11:00:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:00:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221577050] [2022-11-20 11:00:14,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:00:14,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:00:14,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:00:14,310 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:14,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:14,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:00:14,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:00:14,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:00:14,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:00:14,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:00:14,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:00:14,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221577050] [2022-11-20 11:00:14,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221577050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:14,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:14,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:00:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573666146] [2022-11-20 11:00:14,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:14,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:14,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:00:14,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:14,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:14,585 INFO L87 Difference]: Start difference. First operand 224 states and 510 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:14,836 INFO L93 Difference]: Finished difference Result 320 states and 701 transitions. [2022-11-20 11:00:14,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:00:14,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:00:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:14,837 INFO L225 Difference]: With dead ends: 320 [2022-11-20 11:00:14,838 INFO L226 Difference]: Without dead ends: 320 [2022-11-20 11:00:14,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-20 11:00:14,843 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:14,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:00:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-20 11:00:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 212. [2022-11-20 11:00:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 210 states have (on average 2.2904761904761903) internal successors, (481), 211 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 481 transitions. [2022-11-20 11:00:14,850 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 481 transitions. Word has length 21 [2022-11-20 11:00:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:14,850 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 481 transitions. [2022-11-20 11:00:14,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 481 transitions. [2022-11-20 11:00:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:00:14,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:14,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:14,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:15,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:15,065 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-20 11:00:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:15,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1288430040, now seen corresponding path program 3 times [2022-11-20 11:00:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:00:15,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514487290] [2022-11-20 11:00:15,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:00:15,066 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-20 11:00:15,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:00:15,067 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:15,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:15,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 11:00:15,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 11:00:15,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:00:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:00:15,678 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 11:00:15,679 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:00:15,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining) [2022-11-20 11:00:15,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining) [2022-11-20 11:00:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2022-11-20 11:00:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2022-11-20 11:00:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2022-11-20 11:00:15,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2022-11-20 11:00:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2022-11-20 11:00:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2022-11-20 11:00:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2022-11-20 11:00:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2022-11-20 11:00:15,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2022-11-20 11:00:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2022-11-20 11:00:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2022-11-20 11:00:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2022-11-20 11:00:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2022-11-20 11:00:15,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2022-11-20 11:00:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2022-11-20 11:00:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2022-11-20 11:00:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2022-11-20 11:00:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2022-11-20 11:00:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2022-11-20 11:00:15,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2022-11-20 11:00:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2022-11-20 11:00:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2022-11-20 11:00:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2022-11-20 11:00:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2022-11-20 11:00:15,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2022-11-20 11:00:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2022-11-20 11:00:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2022-11-20 11:00:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2022-11-20 11:00:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2022-11-20 11:00:15,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2022-11-20 11:00:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2022-11-20 11:00:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2022-11-20 11:00:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2022-11-20 11:00:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2022-11-20 11:00:15,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2022-11-20 11:00:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2022-11-20 11:00:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining) [2022-11-20 11:00:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining) [2022-11-20 11:00:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining) [2022-11-20 11:00:15,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining) [2022-11-20 11:00:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining) [2022-11-20 11:00:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2022-11-20 11:00:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2022-11-20 11:00:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2022-11-20 11:00:15,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2022-11-20 11:00:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2022-11-20 11:00:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2022-11-20 11:00:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2022-11-20 11:00:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2022-11-20 11:00:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2022-11-20 11:00:15,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2022-11-20 11:00:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2022-11-20 11:00:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2022-11-20 11:00:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2022-11-20 11:00:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2022-11-20 11:00:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2022-11-20 11:00:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2022-11-20 11:00:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2022-11-20 11:00:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2022-11-20 11:00:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2022-11-20 11:00:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2022-11-20 11:00:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2022-11-20 11:00:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2022-11-20 11:00:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2022-11-20 11:00:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2022-11-20 11:00:15,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-20 11:00:15,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/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-20 11:00:15,910 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:15,915 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:00:15,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:00:16,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:00:16 BasicIcfg [2022-11-20 11:00:16,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:00:16,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:00:16,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:00:16,048 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:00:16,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:28" (3/4) ... [2022-11-20 11:00:16,051 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:00:16,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:00:16,052 INFO L158 Benchmark]: Toolchain (without parser) took 110622.34ms. Allocated memory was 79.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 60.3MB in the beginning and 1.0GB in the end (delta: -984.2MB). Peak memory consumption was 757.4MB. Max. memory is 16.1GB. [2022-11-20 11:00:16,052 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 79.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:00:16,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.04ms. Allocated memory is still 79.7MB. Free memory was 60.3MB in the beginning and 35.8MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 11:00:16,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.81ms. Allocated memory is still 79.7MB. Free memory was 35.8MB in the beginning and 58.5MB in the end (delta: -22.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-11-20 11:00:16,053 INFO L158 Benchmark]: Boogie Preprocessor took 68.25ms. Allocated memory is still 79.7MB. Free memory was 58.5MB in the beginning and 55.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:00:16,053 INFO L158 Benchmark]: RCFGBuilder took 1725.04ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 55.6MB in the beginning and 59.5MB in the end (delta: -3.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-11-20 11:00:16,054 INFO L158 Benchmark]: TraceAbstraction took 108025.66ms. Allocated memory was 102.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 58.8MB in the beginning and 1.0GB in the end (delta: -985.7MB). Peak memory consumption was 734.0MB. Max. memory is 16.1GB. [2022-11-20 11:00:16,054 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 1.8GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:00:16,056 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 79.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.04ms. Allocated memory is still 79.7MB. Free memory was 60.3MB in the beginning and 35.8MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.81ms. Allocated memory is still 79.7MB. Free memory was 35.8MB in the beginning and 58.5MB in the end (delta: -22.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.25ms. Allocated memory is still 79.7MB. Free memory was 58.5MB in the beginning and 55.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1725.04ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 55.6MB in the beginning and 59.5MB in the end (delta: -3.9MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * TraceAbstraction took 108025.66ms. Allocated memory was 102.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 58.8MB in the beginning and 1.0GB in the end (delta: -985.7MB). Peak memory consumption was 734.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 1.8GB. Free memory is still 1.0GB. 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: 44.7s, 183 PlacesBefore, 76 PlacesAfterwards, 175 TransitionsBefore, 66 TransitionsAfterwards, 5328 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 154 TotalNumberOfCompositions, 21300 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9548, independent: 9129, independent conditional: 0, independent unconditional: 9129, dependent: 380, dependent conditional: 0, dependent unconditional: 380, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3328, independent: 3240, independent conditional: 0, independent unconditional: 3240, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3328, independent: 3043, independent conditional: 0, independent unconditional: 3043, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 285, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6265, independent: 949, independent conditional: 0, independent unconditional: 949, dependent: 1084, dependent conditional: 0, dependent unconditional: 1084, unknown: 4232, unknown conditional: 0, unknown unconditional: 4232] ], Cache Queries: [ total: 9548, independent: 5889, independent conditional: 0, independent unconditional: 5889, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 3361, unknown conditional: 0, unknown unconditional: 3361] , Statistics on independence cache: Total cache size (in pairs): 778, Positive cache size: 742, Positive conditional cache size: 0, Positive unconditional cache size: 742, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=0, t2052={-2147483641:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=1, t2052={-2147483641:0}, t2053={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; 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_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$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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={-2147483641:0}, t2053={7:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t2054, ((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_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$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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=2, t2052={-2147483641:0}, t2053={7:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 3 z = 1 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L762] 1 __unbuffered_p0_EAX = z 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 1 __unbuffered_p0_EBX = x 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 x = 1 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={-2147483641:0}, t2053={7:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_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_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$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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 225 locations, 67 error locations. Started 1 CEGAR loops. OverallTime: 107.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1032 IncrementalHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 42 mSDtfsCounter, 1032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15204occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 1485 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 49.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 648 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 11:00:16,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd4ccc2e-6d7b-4c94-95fa-161de6de5805/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample