./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_power.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_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/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 cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- 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 09:28:26,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:28:26,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:28:26,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:28:26,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:28:26,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:28:26,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:28:26,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:28:26,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:28:26,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:28:26,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:28:26,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:28:26,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:28:26,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:28:26,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:28:26,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:28:26,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:28:26,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:28:26,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:28:26,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:28:26,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:28:26,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:28:26,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:28:26,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:28:26,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:28:26,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:28:26,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:28:26,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:28:26,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:28:26,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:28:26,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:28:26,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:28:26,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:28:26,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:28:26,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:28:26,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:28:26,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:28:26,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:28:26,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:28:26,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:28:26,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:28:26,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:28:26,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:28:26,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:28:26,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:28:26,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:28:26,556 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:28:26,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:28:26,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:28:26,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:28:26,557 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:28:26,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:28:26,558 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:28:26,558 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:28:26,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:28:26,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:28:26,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:28:26,559 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:28:26,559 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:28:26,559 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:28:26,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:28:26,560 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:28:26,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:28:26,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:28:26,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:28:26,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:28:26,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:28:26,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:28:26,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:28:26,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:28:26,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:28:26,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:28:26,562 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_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/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 -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-11-20 09:28:26,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:28:26,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:28:26,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:28:26,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:28:26,888 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:28:26,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-20 09:28:30,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:28:30,424 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:28:30,425 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-20 09:28:30,440 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data/5ebdad22f/e57b7acd9aab44dd92602fa18fbbfb34/FLAG50f39d11f [2022-11-20 09:28:30,457 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data/5ebdad22f/e57b7acd9aab44dd92602fa18fbbfb34 [2022-11-20 09:28:30,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:28:30,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:28:30,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:28:30,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:28:30,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:28:30,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:28:30" (1/1) ... [2022-11-20 09:28:30,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc58142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:30, skipping insertion in model container [2022-11-20 09:28:30,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:28:30" (1/1) ... [2022-11-20 09:28:30,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:28:30,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:28:30,749 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_be662580-cc63-48da-a68e-599416e7e6bf/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-20 09:28:31,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:28:31,161 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:28:31,180 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_be662580-cc63-48da-a68e-599416e7e6bf/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-20 09:28:31,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:28:31,352 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:28:31,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31 WrapperNode [2022-11-20 09:28:31,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:28:31,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:28:31,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:28:31,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:28:31,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,437 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-11-20 09:28:31,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:28:31,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:28:31,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:28:31,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:28:31,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,487 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:28:31,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:28:31,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:28:31,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:28:31,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (1/1) ... [2022-11-20 09:28:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:28:31,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:31,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:28:31,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:28:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:28:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:28:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:28:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:28:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:28:31,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:28:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:28:31,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:28:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:28:31,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:28:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:28:31,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:28:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:28:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:28:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:28:31,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:28:31,615 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 09:28:31,894 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:28:31,896 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:28:32,590 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:28:33,278 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:28:33,278 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:28:33,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:28:33 BoogieIcfgContainer [2022-11-20 09:28:33,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:28:33,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:28:33,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:28:33,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:28:33,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:28:30" (1/3) ... [2022-11-20 09:28:33,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63741926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:28:33, skipping insertion in model container [2022-11-20 09:28:33,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:31" (2/3) ... [2022-11-20 09:28:33,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63741926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:28:33, skipping insertion in model container [2022-11-20 09:28:33,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:28:33" (3/3) ... [2022-11-20 09:28:33,295 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-11-20 09:28:33,323 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:28:33,323 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-20 09:28:33,324 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:28:33,520 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:28:33,570 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:28:33,590 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 183 transitions, 381 flow [2022-11-20 09:28:33,595 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 183 transitions, 381 flow [2022-11-20 09:28:33,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 183 transitions, 381 flow [2022-11-20 09:28:33,741 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2022-11-20 09:28:33,742 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:28:33,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 295 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-20 09:28:33,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512 [2022-11-20 09:28:54,890 INFO L134 LiptonReduction]: Checked pairs total: 33616 [2022-11-20 09:28:54,891 INFO L136 LiptonReduction]: Total number of compositions: 180 [2022-11-20 09:28:54,899 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 173 flow [2022-11-20 09:28:57,735 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 09:28:57,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:28:57,769 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;@8bd36ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:28:57,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2022-11-20 09:28:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 09:28:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:28:57,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:57,893 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:28:57,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:28:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1229, now seen corresponding path program 1 times [2022-11-20 09:28:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:57,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773439643] [2022-11-20 09:28:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:58,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773439643] [2022-11-20 09:28:58,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773439643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:58,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:58,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:28:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855113785] [2022-11-20 09:28:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:58,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:28:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:28:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:28:58,240 INFO L87 Difference]: Start difference. First operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 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 09:28:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:58,563 INFO L93 Difference]: Finished difference Result 9084 states and 32205 transitions. [2022-11-20 09:28:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:28:58,565 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 09:28:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:58,671 INFO L225 Difference]: With dead ends: 9084 [2022-11-20 09:28:58,671 INFO L226 Difference]: Without dead ends: 9084 [2022-11-20 09:28:58,672 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 09:28:58,677 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:58,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:28:58,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-11-20 09:28:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9084. [2022-11-20 09:28:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7951 states have (on average 4.050433907684568) internal successors, (32205), 9083 states have internal predecessors, (32205), 0 states have call successors, (0), 0 states 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 09:28:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 32205 transitions. [2022-11-20 09:28:59,443 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 32205 transitions. Word has length 1 [2022-11-20 09:28:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:59,444 INFO L495 AbstractCegarLoop]: Abstraction has 9084 states and 32205 transitions. [2022-11-20 09:28:59,448 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 09:28:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 32205 transitions. [2022-11-20 09:28:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 09:28:59,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:59,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 09:28:59,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:28:59,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:28:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 37596274, now seen corresponding path program 1 times [2022-11-20 09:28:59,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:59,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455980371] [2022-11-20 09:28:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:59,819 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 09:28:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:59,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455980371] [2022-11-20 09:28:59,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455980371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:59,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:59,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:28:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458201810] [2022-11-20 09:28:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:59,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:59,825 INFO L87 Difference]: Start difference. First operand 9084 states and 32205 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:00,109 INFO L93 Difference]: Finished difference Result 6818 states and 22177 transitions. [2022-11-20 09:29:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:00,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 09:29:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:00,176 INFO L225 Difference]: With dead ends: 6818 [2022-11-20 09:29:00,177 INFO L226 Difference]: Without dead ends: 6818 [2022-11-20 09:29:00,177 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 09:29:00,178 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:00,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2022-11-20 09:29:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6090. [2022-11-20 09:29:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6090 states, 5679 states have (on average 3.729705934143335) internal successors, (21181), 6089 states have internal predecessors, (21181), 0 states have call successors, (0), 0 states 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 09:29:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 21181 transitions. [2022-11-20 09:29:00,661 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 21181 transitions. Word has length 4 [2022-11-20 09:29:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 6090 states and 21181 transitions. [2022-11-20 09:29:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 21181 transitions. [2022-11-20 09:29:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 09:29:00,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:00,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 09:29:00,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:29:00,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash 37596275, now seen corresponding path program 1 times [2022-11-20 09:29:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:00,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732018485] [2022-11-20 09:29:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:00,803 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 09:29:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:00,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732018485] [2022-11-20 09:29:00,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732018485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:00,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:00,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979502785] [2022-11-20 09:29:00,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:00,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:00,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:00,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:00,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:00,806 INFO L87 Difference]: Start difference. First operand 6090 states and 21181 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:00,938 INFO L93 Difference]: Finished difference Result 2502 states and 7903 transitions. [2022-11-20 09:29:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:00,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 09:29:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:00,954 INFO L225 Difference]: With dead ends: 2502 [2022-11-20 09:29:00,954 INFO L226 Difference]: Without dead ends: 2452 [2022-11-20 09:29:00,954 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 09:29:00,956 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:00,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-11-20 09:29:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452. [2022-11-20 09:29:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2383 states have (on average 3.2459085186739403) internal successors, (7735), 2451 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states 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 09:29:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 7735 transitions. [2022-11-20 09:29:01,056 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 7735 transitions. Word has length 4 [2022-11-20 09:29:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:01,057 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 7735 transitions. [2022-11-20 09:29:01,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 7735 transitions. [2022-11-20 09:29:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 09:29:01,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:01,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 09:29:01,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:29:01,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1770872972, now seen corresponding path program 1 times [2022-11-20 09:29:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513088170] [2022-11-20 09:29:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,339 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 09:29:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513088170] [2022-11-20 09:29:01,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513088170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:01,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:01,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420635365] [2022-11-20 09:29:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:01,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:01,342 INFO L87 Difference]: Start difference. First operand 2452 states and 7735 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 09:29:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:01,497 INFO L93 Difference]: Finished difference Result 2076 states and 6397 transitions. [2022-11-20 09:29:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:01,498 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 09:29:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:01,508 INFO L225 Difference]: With dead ends: 2076 [2022-11-20 09:29:01,508 INFO L226 Difference]: Without dead ends: 2058 [2022-11-20 09:29:01,509 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 09:29:01,512 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:01,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-11-20 09:29:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2022-11-20 09:29:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2008 states have (on average 3.1658366533864544) internal successors, (6357), 2057 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states 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 09:29:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 6357 transitions. [2022-11-20 09:29:01,587 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 6357 transitions. Word has length 6 [2022-11-20 09:29:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:01,589 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 6357 transitions. [2022-11-20 09:29:01,589 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 09:29:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 6357 transitions. [2022-11-20 09:29:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 09:29:01,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:01,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:01,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:29:01,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:01,592 INFO L85 PathProgramCache]: Analyzing trace with hash 800420768, now seen corresponding path program 1 times [2022-11-20 09:29:01,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123754007] [2022-11-20 09:29:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,739 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 09:29:01,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:01,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123754007] [2022-11-20 09:29:01,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123754007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:01,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:01,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350633608] [2022-11-20 09:29:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:01,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:01,745 INFO L87 Difference]: Start difference. First operand 2058 states and 6357 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 09:29:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:01,898 INFO L93 Difference]: Finished difference Result 2026 states and 6245 transitions. [2022-11-20 09:29:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:01,905 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 09:29:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:01,915 INFO L225 Difference]: With dead ends: 2026 [2022-11-20 09:29:01,915 INFO L226 Difference]: Without dead ends: 2026 [2022-11-20 09:29:01,915 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 09:29:01,916 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:01,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-11-20 09:29:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2022-11-20 09:29:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1976 states have (on average 3.160425101214575) internal successors, (6245), 2025 states have internal predecessors, (6245), 0 states have call successors, (0), 0 states 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 09:29:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 6245 transitions. [2022-11-20 09:29:01,988 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 6245 transitions. Word has length 10 [2022-11-20 09:29:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:01,989 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 6245 transitions. [2022-11-20 09:29:01,989 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 09:29:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 6245 transitions. [2022-11-20 09:29:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:29:01,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:01,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:01,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:29:01,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash -956893836, now seen corresponding path program 1 times [2022-11-20 09:29:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:01,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653921951] [2022-11-20 09:29:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:02,243 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 09:29:02,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:02,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653921951] [2022-11-20 09:29:02,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653921951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:02,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:02,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:02,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995457659] [2022-11-20 09:29:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:02,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:02,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:02,247 INFO L87 Difference]: Start difference. First operand 2026 states and 6245 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:02,411 INFO L93 Difference]: Finished difference Result 2290 states and 6877 transitions. [2022-11-20 09:29:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:02,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:29:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:02,425 INFO L225 Difference]: With dead ends: 2290 [2022-11-20 09:29:02,425 INFO L226 Difference]: Without dead ends: 2290 [2022-11-20 09:29:02,426 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 09:29:02,427 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:02,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2022-11-20 09:29:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1962. [2022-11-20 09:29:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1913 states have (on average 3.1557762676424463) internal successors, (6037), 1961 states have internal predecessors, (6037), 0 states have call successors, (0), 0 states 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 09:29:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 6037 transitions. [2022-11-20 09:29:02,500 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 6037 transitions. Word has length 11 [2022-11-20 09:29:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:02,501 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 6037 transitions. [2022-11-20 09:29:02,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 6037 transitions. [2022-11-20 09:29:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:29:02,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:02,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:02,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:29:02,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -956893835, now seen corresponding path program 1 times [2022-11-20 09:29:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:02,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76327357] [2022-11-20 09:29:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,380 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 09:29:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:03,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76327357] [2022-11-20 09:29:03,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76327357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:03,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:03,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34215491] [2022-11-20 09:29:03,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:03,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:03,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:03,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:03,385 INFO L87 Difference]: Start difference. First operand 1962 states and 6037 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:03,707 INFO L93 Difference]: Finished difference Result 3042 states and 9315 transitions. [2022-11-20 09:29:03,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:29:03,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:29:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:03,728 INFO L225 Difference]: With dead ends: 3042 [2022-11-20 09:29:03,728 INFO L226 Difference]: Without dead ends: 3042 [2022-11-20 09:29:03,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:29:03,729 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:03,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 4 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:29:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2022-11-20 09:29:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2042. [2022-11-20 09:29:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1993 states have (on average 3.153537380832915) internal successors, (6285), 2041 states have internal predecessors, (6285), 0 states have call successors, (0), 0 states 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 09:29:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 6285 transitions. [2022-11-20 09:29:03,837 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 6285 transitions. Word has length 11 [2022-11-20 09:29:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:03,837 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 6285 transitions. [2022-11-20 09:29:03,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 6285 transitions. [2022-11-20 09:29:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:29:03,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:03,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:03,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:29:03,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -956765499, now seen corresponding path program 1 times [2022-11-20 09:29:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:03,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940271267] [2022-11-20 09:29:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:04,022 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 09:29:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:04,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940271267] [2022-11-20 09:29:04,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940271267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:04,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:04,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055276468] [2022-11-20 09:29:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:04,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:04,026 INFO L87 Difference]: Start difference. First operand 2042 states and 6285 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:04,157 INFO L93 Difference]: Finished difference Result 2034 states and 6255 transitions. [2022-11-20 09:29:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:29:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:04,169 INFO L225 Difference]: With dead ends: 2034 [2022-11-20 09:29:04,169 INFO L226 Difference]: Without dead ends: 2034 [2022-11-20 09:29:04,170 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 09:29:04,171 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:04,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-11-20 09:29:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034. [2022-11-20 09:29:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1985 states have (on average 3.1511335012594457) internal successors, (6255), 2033 states have internal predecessors, (6255), 0 states have call successors, (0), 0 states 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 09:29:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 6255 transitions. [2022-11-20 09:29:04,287 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 6255 transitions. Word has length 11 [2022-11-20 09:29:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:04,288 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 6255 transitions. [2022-11-20 09:29:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 6255 transitions. [2022-11-20 09:29:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:29:04,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:04,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:04,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:29:04,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1826510904, now seen corresponding path program 1 times [2022-11-20 09:29:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:04,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291316594] [2022-11-20 09:29:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:04,621 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 09:29:04,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:04,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291316594] [2022-11-20 09:29:04,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291316594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:04,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:04,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188535195] [2022-11-20 09:29:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:04,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:04,624 INFO L87 Difference]: Start difference. First operand 2034 states and 6255 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:04,762 INFO L93 Difference]: Finished difference Result 2022 states and 6214 transitions. [2022-11-20 09:29:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:04,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:29:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:04,771 INFO L225 Difference]: With dead ends: 2022 [2022-11-20 09:29:04,772 INFO L226 Difference]: Without dead ends: 2022 [2022-11-20 09:29:04,772 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 09:29:04,773 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:04,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2022-11-20 09:29:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2022. [2022-11-20 09:29:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1973 states have (on average 3.149518499746579) internal successors, (6214), 2021 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states 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 09:29:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 6214 transitions. [2022-11-20 09:29:04,834 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 6214 transitions. Word has length 12 [2022-11-20 09:29:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:04,834 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 6214 transitions. [2022-11-20 09:29:04,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 6214 transitions. [2022-11-20 09:29:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:29:04,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:04,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:04,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:29:04,836 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1813369789, now seen corresponding path program 1 times [2022-11-20 09:29:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923510387] [2022-11-20 09:29:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:05,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923510387] [2022-11-20 09:29:05,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923510387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:05,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:05,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123541867] [2022-11-20 09:29:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:05,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:05,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:05,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:05,170 INFO L87 Difference]: Start difference. First operand 2022 states and 6214 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:05,306 INFO L93 Difference]: Finished difference Result 1974 states and 6062 transitions. [2022-11-20 09:29:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:05,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:29:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:05,317 INFO L225 Difference]: With dead ends: 1974 [2022-11-20 09:29:05,318 INFO L226 Difference]: Without dead ends: 1974 [2022-11-20 09:29:05,318 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 09:29:05,319 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:05,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2022-11-20 09:29:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1878. [2022-11-20 09:29:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1830 states have (on average 3.146448087431694) internal successors, (5758), 1877 states have internal predecessors, (5758), 0 states have call successors, (0), 0 states 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 09:29:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 5758 transitions. [2022-11-20 09:29:05,392 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 5758 transitions. Word has length 12 [2022-11-20 09:29:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:05,393 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 5758 transitions. [2022-11-20 09:29:05,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 5758 transitions. [2022-11-20 09:29:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:05,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:05,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:05,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:29:05,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash 787430718, now seen corresponding path program 1 times [2022-11-20 09:29:05,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:05,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499262484] [2022-11-20 09:29:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:07,700 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 09:29:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:07,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499262484] [2022-11-20 09:29:07,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499262484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:07,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:07,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:29:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55649789] [2022-11-20 09:29:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:07,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:29:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:29:07,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:07,704 INFO L87 Difference]: Start difference. First operand 1878 states and 5758 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 09:29:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:08,583 INFO L93 Difference]: Finished difference Result 2227 states and 6910 transitions. [2022-11-20 09:29:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:29:08,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 09:29:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:08,598 INFO L225 Difference]: With dead ends: 2227 [2022-11-20 09:29:08,598 INFO L226 Difference]: Without dead ends: 2227 [2022-11-20 09:29:08,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:29:08,599 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:08,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 13 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:29:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2022-11-20 09:29:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1919. [2022-11-20 09:29:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1871 states have (on average 3.140566541956173) internal successors, (5876), 1918 states have internal predecessors, (5876), 0 states have call successors, (0), 0 states 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 09:29:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 5876 transitions. [2022-11-20 09:29:08,684 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 5876 transitions. Word has length 13 [2022-11-20 09:29:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:08,685 INFO L495 AbstractCegarLoop]: Abstraction has 1919 states and 5876 transitions. [2022-11-20 09:29:08,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 09:29:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 5876 transitions. [2022-11-20 09:29:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:08,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:08,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:08,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:29:08,687 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash -328616794, now seen corresponding path program 1 times [2022-11-20 09:29:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:08,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592385679] [2022-11-20 09:29:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:08,885 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 09:29:08,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:08,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592385679] [2022-11-20 09:29:08,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592385679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:08,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:08,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176024677] [2022-11-20 09:29:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:08,889 INFO L87 Difference]: Start difference. First operand 1919 states and 5876 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:09,073 INFO L93 Difference]: Finished difference Result 1843 states and 5348 transitions. [2022-11-20 09:29:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:09,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 09:29:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:09,084 INFO L225 Difference]: With dead ends: 1843 [2022-11-20 09:29:09,084 INFO L226 Difference]: Without dead ends: 1843 [2022-11-20 09:29:09,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:09,085 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:09,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-20 09:29:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1621. [2022-11-20 09:29:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1573 states have (on average 3.109345200254291) internal successors, (4891), 1620 states have internal predecessors, (4891), 0 states have call successors, (0), 0 states 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 09:29:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 4891 transitions. [2022-11-20 09:29:09,153 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 4891 transitions. Word has length 13 [2022-11-20 09:29:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:09,154 INFO L495 AbstractCegarLoop]: Abstraction has 1621 states and 4891 transitions. [2022-11-20 09:29:09,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 4891 transitions. [2022-11-20 09:29:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:29:09,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:09,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:09,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:29:09,157 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash -656119076, now seen corresponding path program 1 times [2022-11-20 09:29:09,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:09,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977368761] [2022-11-20 09:29:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:09,459 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 09:29:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:09,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977368761] [2022-11-20 09:29:09,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977368761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:09,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:09,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546171622] [2022-11-20 09:29:09,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:09,462 INFO L87 Difference]: Start difference. First operand 1621 states and 4891 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:09,571 INFO L93 Difference]: Finished difference Result 737 states and 1875 transitions. [2022-11-20 09:29:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:09,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:29:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:09,576 INFO L225 Difference]: With dead ends: 737 [2022-11-20 09:29:09,576 INFO L226 Difference]: Without dead ends: 737 [2022-11-20 09:29:09,576 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 09:29:09,577 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 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 09:29:09,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-11-20 09:29:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 733. [2022-11-20 09:29:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 697 states have (on average 2.672883787661406) internal successors, (1863), 732 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states 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 09:29:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1863 transitions. [2022-11-20 09:29:09,604 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1863 transitions. Word has length 14 [2022-11-20 09:29:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:09,604 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 1863 transitions. [2022-11-20 09:29:09,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1863 transitions. [2022-11-20 09:29:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:29:09,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:09,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:09,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:29:09,607 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1410074037, now seen corresponding path program 1 times [2022-11-20 09:29:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632898079] [2022-11-20 09:29:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:09,844 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 09:29:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:09,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632898079] [2022-11-20 09:29:09,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632898079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:09,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:09,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149743974] [2022-11-20 09:29:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:09,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:09,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:09,847 INFO L87 Difference]: Start difference. First operand 733 states and 1863 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:09,981 INFO L93 Difference]: Finished difference Result 1077 states and 2706 transitions. [2022-11-20 09:29:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 09:29:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:09,985 INFO L225 Difference]: With dead ends: 1077 [2022-11-20 09:29:09,985 INFO L226 Difference]: Without dead ends: 1077 [2022-11-20 09:29:09,986 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 09:29:09,986 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:09,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-11-20 09:29:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 811. [2022-11-20 09:29:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 775 states have (on average 2.672258064516129) internal successors, (2071), 810 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states 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 09:29:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2071 transitions. [2022-11-20 09:29:10,010 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2071 transitions. Word has length 15 [2022-11-20 09:29:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:10,010 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2071 transitions. [2022-11-20 09:29:10,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2071 transitions. [2022-11-20 09:29:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:29:10,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:10,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:10,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:29:10,013 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash 61858436, now seen corresponding path program 1 times [2022-11-20 09:29:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:10,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020346527] [2022-11-20 09:29:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:10,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:10,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020346527] [2022-11-20 09:29:10,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020346527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:10,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:10,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:29:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833246987] [2022-11-20 09:29:10,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:10,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:10,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:10,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:10,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:10,281 INFO L87 Difference]: Start difference. First operand 811 states and 2071 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:10,418 INFO L93 Difference]: Finished difference Result 302 states and 641 transitions. [2022-11-20 09:29:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:29:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:10,420 INFO L225 Difference]: With dead ends: 302 [2022-11-20 09:29:10,420 INFO L226 Difference]: Without dead ends: 302 [2022-11-20 09:29:10,420 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 09:29:10,421 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:10,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-20 09:29:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2022-11-20 09:29:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 284 states have (on average 2.221830985915493) internal successors, (631), 297 states have internal predecessors, (631), 0 states have call successors, (0), 0 states 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 09:29:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 631 transitions. [2022-11-20 09:29:10,428 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 631 transitions. Word has length 16 [2022-11-20 09:29:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:10,429 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 631 transitions. [2022-11-20 09:29:10,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 631 transitions. [2022-11-20 09:29:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:10,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:10,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:10,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:29:10,431 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash -565953270, now seen corresponding path program 1 times [2022-11-20 09:29:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:10,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462048099] [2022-11-20 09:29:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:12,531 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 09:29:12,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:12,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462048099] [2022-11-20 09:29:12,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462048099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:12,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:12,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:29:12,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540977541] [2022-11-20 09:29:12,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:12,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:29:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:29:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:29:12,537 INFO L87 Difference]: Start difference. First operand 298 states and 631 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:13,069 INFO L93 Difference]: Finished difference Result 548 states and 1133 transitions. [2022-11-20 09:29:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:29:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:29:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:13,071 INFO L225 Difference]: With dead ends: 548 [2022-11-20 09:29:13,071 INFO L226 Difference]: Without dead ends: 548 [2022-11-20 09:29:13,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:29:13,072 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 103 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:13,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 15 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:29:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-20 09:29:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 341. [2022-11-20 09:29:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 327 states have (on average 2.232415902140673) internal successors, (730), 340 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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 09:29:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 730 transitions. [2022-11-20 09:29:13,081 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 730 transitions. Word has length 18 [2022-11-20 09:29:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:13,082 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 730 transitions. [2022-11-20 09:29:13,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 730 transitions. [2022-11-20 09:29:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:13,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:13,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:29:13,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1845031186, now seen corresponding path program 2 times [2022-11-20 09:29:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:13,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821799857] [2022-11-20 09:29:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:15,507 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 09:29:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:15,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821799857] [2022-11-20 09:29:15,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821799857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:15,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:15,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:29:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121188306] [2022-11-20 09:29:15,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:15,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:29:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:29:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:29:15,510 INFO L87 Difference]: Start difference. First operand 341 states and 730 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:16,315 INFO L93 Difference]: Finished difference Result 655 states and 1337 transitions. [2022-11-20 09:29:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:29:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:29:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:16,325 INFO L225 Difference]: With dead ends: 655 [2022-11-20 09:29:16,325 INFO L226 Difference]: Without dead ends: 655 [2022-11-20 09:29:16,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:29:16,326 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 84 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:16,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 27 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:29:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-11-20 09:29:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 362. [2022-11-20 09:29:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 348 states have (on average 2.2442528735632186) internal successors, (781), 361 states have internal predecessors, (781), 0 states have call successors, (0), 0 states 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 09:29:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 781 transitions. [2022-11-20 09:29:16,343 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 781 transitions. Word has length 18 [2022-11-20 09:29:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:16,343 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 781 transitions. [2022-11-20 09:29:16,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 781 transitions. [2022-11-20 09:29:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:16,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:16,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:16,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:29:16,345 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash 445036638, now seen corresponding path program 3 times [2022-11-20 09:29:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:16,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4372456] [2022-11-20 09:29:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:16,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:17,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4372456] [2022-11-20 09:29:17,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4372456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:17,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:17,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:29:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208662584] [2022-11-20 09:29:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:17,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:29:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:29:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:29:17,251 INFO L87 Difference]: Start difference. First operand 362 states and 781 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:17,623 INFO L93 Difference]: Finished difference Result 646 states and 1342 transitions. [2022-11-20 09:29:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:29:17,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:29:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:17,625 INFO L225 Difference]: With dead ends: 646 [2022-11-20 09:29:17,625 INFO L226 Difference]: Without dead ends: 646 [2022-11-20 09:29:17,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:29:17,626 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:17,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 15 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:29:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-11-20 09:29:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 390. [2022-11-20 09:29:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 376 states have (on average 2.24468085106383) internal successors, (844), 389 states have internal predecessors, (844), 0 states have call successors, (0), 0 states 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 09:29:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 844 transitions. [2022-11-20 09:29:17,637 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 844 transitions. Word has length 18 [2022-11-20 09:29:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:17,638 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 844 transitions. [2022-11-20 09:29:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 844 transitions. [2022-11-20 09:29:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:17,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:17,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:17,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:29:17,640 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 221702010, now seen corresponding path program 4 times [2022-11-20 09:29:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724440714] [2022-11-20 09:29:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:20,030 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 09:29:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:20,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724440714] [2022-11-20 09:29:20,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724440714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:20,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:20,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:29:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810982121] [2022-11-20 09:29:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:20,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:29:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:20,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:29:20,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:29:20,032 INFO L87 Difference]: Start difference. First operand 390 states and 844 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:20,643 INFO L93 Difference]: Finished difference Result 584 states and 1213 transitions. [2022-11-20 09:29:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:29:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:29:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:20,647 INFO L225 Difference]: With dead ends: 584 [2022-11-20 09:29:20,647 INFO L226 Difference]: Without dead ends: 584 [2022-11-20 09:29:20,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:20,648 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:20,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 21 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:29:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-20 09:29:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 378. [2022-11-20 09:29:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 364 states have (on average 2.2362637362637363) internal successors, (814), 377 states have internal predecessors, (814), 0 states have call successors, (0), 0 states 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 09:29:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 814 transitions. [2022-11-20 09:29:20,660 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 814 transitions. Word has length 18 [2022-11-20 09:29:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:20,660 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 814 transitions. [2022-11-20 09:29:20,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 814 transitions. [2022-11-20 09:29:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:29:20,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:20,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:20,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:29:20,662 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1655729158, now seen corresponding path program 5 times [2022-11-20 09:29:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:20,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378844491] [2022-11-20 09:29:20,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:21,015 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 09:29:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:21,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378844491] [2022-11-20 09:29:21,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378844491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:21,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:21,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:29:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480556577] [2022-11-20 09:29:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:21,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:21,018 INFO L87 Difference]: Start difference. First operand 378 states and 814 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:21,154 INFO L93 Difference]: Finished difference Result 250 states and 552 transitions. [2022-11-20 09:29:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:29:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:29:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:21,156 INFO L225 Difference]: With dead ends: 250 [2022-11-20 09:29:21,156 INFO L226 Difference]: Without dead ends: 250 [2022-11-20 09:29:21,156 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 09:29:21,157 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:21,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 3 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-20 09:29:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 204. [2022-11-20 09:29:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 202 states have (on average 2.2475247524752477) internal successors, (454), 203 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 454 transitions. [2022-11-20 09:29:21,162 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 454 transitions. Word has length 18 [2022-11-20 09:29:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:21,163 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 454 transitions. [2022-11-20 09:29:21,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 454 transitions. [2022-11-20 09:29:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:29:21,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:21,167 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 09:29:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 09:29:21,168 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -407911642, now seen corresponding path program 1 times [2022-11-20 09:29:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:21,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380355452] [2022-11-20 09:29:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:23,817 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 09:29:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:23,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380355452] [2022-11-20 09:29:23,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380355452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:23,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:23,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:29:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642110297] [2022-11-20 09:29:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:23,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 09:29:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 09:29:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:29:23,819 INFO L87 Difference]: Start difference. First operand 204 states and 454 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 09:29:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:24,492 INFO L93 Difference]: Finished difference Result 505 states and 1029 transitions. [2022-11-20 09:29:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:29:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 09:29:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:24,494 INFO L225 Difference]: With dead ends: 505 [2022-11-20 09:29:24,494 INFO L226 Difference]: Without dead ends: 505 [2022-11-20 09:29:24,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:29:24,495 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 104 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:24,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 29 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:29:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-20 09:29:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 209. [2022-11-20 09:29:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 207 states have (on average 2.256038647342995) internal successors, (467), 208 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 09:29:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 467 transitions. [2022-11-20 09:29:24,503 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 467 transitions. Word has length 21 [2022-11-20 09:29:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:24,503 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 467 transitions. [2022-11-20 09:29:24,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 09:29:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 467 transitions. [2022-11-20 09:29:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:29:24,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:24,505 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 09:29:24,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 09:29:24,505 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:24,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1352157802, now seen corresponding path program 2 times [2022-11-20 09:29:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:24,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146958257] [2022-11-20 09:29:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:27,673 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 09:29:27,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:27,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146958257] [2022-11-20 09:29:27,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146958257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:27,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:27,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:29:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230092982] [2022-11-20 09:29:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:27,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:29:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:27,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:29:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:27,674 INFO L87 Difference]: Start difference. First operand 209 states and 467 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:29:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:28,151 INFO L93 Difference]: Finished difference Result 311 states and 664 transitions. [2022-11-20 09:29:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:29:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:29:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:28,153 INFO L225 Difference]: With dead ends: 311 [2022-11-20 09:29:28,153 INFO L226 Difference]: Without dead ends: 311 [2022-11-20 09:29:28,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:29:28,154 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:28,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 27 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:29:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-20 09:29:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 215. [2022-11-20 09:29:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 2.2629107981220655) internal successors, (482), 214 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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 09:29:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 482 transitions. [2022-11-20 09:29:28,162 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 482 transitions. Word has length 21 [2022-11-20 09:29:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:28,163 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 482 transitions. [2022-11-20 09:29:28,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:29:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 482 transitions. [2022-11-20 09:29:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:29:28,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:28,164 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 09:29:28,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 09:29:28,165 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:28,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1929643882, now seen corresponding path program 3 times [2022-11-20 09:29:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925120423] [2022-11-20 09:29:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:31,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:31,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925120423] [2022-11-20 09:29:31,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925120423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:31,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:31,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:29:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343964220] [2022-11-20 09:29:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:31,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:29:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:29:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:29:31,310 INFO L87 Difference]: Start difference. First operand 215 states and 482 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:29:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:31,968 INFO L93 Difference]: Finished difference Result 369 states and 778 transitions. [2022-11-20 09:29:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:29:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:29:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:31,969 INFO L225 Difference]: With dead ends: 369 [2022-11-20 09:29:31,970 INFO L226 Difference]: Without dead ends: 369 [2022-11-20 09:29:31,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:29:31,970 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:31,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 36 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:29:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-20 09:29:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 209. [2022-11-20 09:29:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 207 states have (on average 2.256038647342995) internal successors, (467), 208 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 09:29:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 467 transitions. [2022-11-20 09:29:31,978 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 467 transitions. Word has length 21 [2022-11-20 09:29:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:31,978 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 467 transitions. [2022-11-20 09:29:31,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:29:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 467 transitions. [2022-11-20 09:29:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:29:31,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:31,979 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 09:29:31,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 09:29:31,980 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1489394906, now seen corresponding path program 4 times [2022-11-20 09:29:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:31,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777925290] [2022-11-20 09:29:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:35,665 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 09:29:35,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:35,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777925290] [2022-11-20 09:29:35,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777925290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:35,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:35,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:29:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478660894] [2022-11-20 09:29:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:35,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 09:29:35,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:35,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 09:29:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:29:35,667 INFO L87 Difference]: Start difference. First operand 209 states and 467 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 09:29:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:36,589 INFO L93 Difference]: Finished difference Result 334 states and 709 transitions. [2022-11-20 09:29:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:29:36,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 09:29:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:36,591 INFO L225 Difference]: With dead ends: 334 [2022-11-20 09:29:36,591 INFO L226 Difference]: Without dead ends: 334 [2022-11-20 09:29:36,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:29:36,592 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:36,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:29:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-20 09:29:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 211. [2022-11-20 09:29:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 2.263157894736842) internal successors, (473), 210 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 09:29:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 473 transitions. [2022-11-20 09:29:36,600 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 473 transitions. Word has length 21 [2022-11-20 09:29:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:36,600 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 473 transitions. [2022-11-20 09:29:36,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 09:29:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 473 transitions. [2022-11-20 09:29:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:29:36,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:36,602 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 09:29:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 09:29:36,602 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:29:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1304757846, now seen corresponding path program 5 times [2022-11-20 09:29:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:36,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280729739] [2022-11-20 09:29:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:29:36,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:29:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:29:36,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:29:36,908 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:29:36,910 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2022-11-20 09:29:36,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2022-11-20 09:29:36,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2022-11-20 09:29:36,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2022-11-20 09:29:36,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2022-11-20 09:29:36,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2022-11-20 09:29:36,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2022-11-20 09:29:36,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2022-11-20 09:29:36,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2022-11-20 09:29:36,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2022-11-20 09:29:36,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2022-11-20 09:29:36,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2022-11-20 09:29:36,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2022-11-20 09:29:36,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2022-11-20 09:29:36,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2022-11-20 09:29:36,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2022-11-20 09:29:36,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2022-11-20 09:29:36,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2022-11-20 09:29:36,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2022-11-20 09:29:36,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2022-11-20 09:29:36,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2022-11-20 09:29:36,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2022-11-20 09:29:36,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2022-11-20 09:29:36,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2022-11-20 09:29:36,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2022-11-20 09:29:36,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2022-11-20 09:29:36,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2022-11-20 09:29:36,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2022-11-20 09:29:36,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2022-11-20 09:29:36,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2022-11-20 09:29:36,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2022-11-20 09:29:36,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2022-11-20 09:29:36,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2022-11-20 09:29:36,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2022-11-20 09:29:36,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2022-11-20 09:29:36,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2022-11-20 09:29:36,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2022-11-20 09:29:36,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2022-11-20 09:29:36,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2022-11-20 09:29:36,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2022-11-20 09:29:36,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2022-11-20 09:29:36,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2022-11-20 09:29:36,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2022-11-20 09:29:36,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2022-11-20 09:29:36,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2022-11-20 09:29:36,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2022-11-20 09:29:36,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2022-11-20 09:29:36,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2022-11-20 09:29:36,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2022-11-20 09:29:36,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2022-11-20 09:29:36,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2022-11-20 09:29:36,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2022-11-20 09:29:36,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2022-11-20 09:29:36,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2022-11-20 09:29:36,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2022-11-20 09:29:36,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2022-11-20 09:29:36,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2022-11-20 09:29:36,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2022-11-20 09:29:36,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2022-11-20 09:29:36,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2022-11-20 09:29:36,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2022-11-20 09:29:36,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2022-11-20 09:29:36,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2022-11-20 09:29:36,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2022-11-20 09:29:36,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2022-11-20 09:29:36,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2022-11-20 09:29:36,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2022-11-20 09:29:36,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2022-11-20 09:29:36,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2022-11-20 09:29:36,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2022-11-20 09:29:36,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2022-11-20 09:29:36,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2022-11-20 09:29:36,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2022-11-20 09:29:36,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2022-11-20 09:29:36,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2022-11-20 09:29:36,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2022-11-20 09:29:36,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2022-11-20 09:29:36,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2022-11-20 09:29:36,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2022-11-20 09:29:36,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2022-11-20 09:29:36,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2022-11-20 09:29:36,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2022-11-20 09:29:36,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2022-11-20 09:29:36,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2022-11-20 09:29:36,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2022-11-20 09:29:36,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2022-11-20 09:29:36,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2022-11-20 09:29:36,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2022-11-20 09:29:36,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2022-11-20 09:29:36,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2022-11-20 09:29:36,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2022-11-20 09:29:36,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 09:29:36,935 INFO L444 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:36,944 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:29:36,945 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:29:37,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:29:37 BasicIcfg [2022-11-20 09:29:37,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:29:37,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:29:37,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:29:37,097 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:29:37,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:28:33" (3/4) ... [2022-11-20 09:29:37,101 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:29:37,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:29:37,102 INFO L158 Benchmark]: Toolchain (without parser) took 66639.29ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 111.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 742.8MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,103 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:29:37,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 891.87ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 86.3MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.69ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 83.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,104 INFO L158 Benchmark]: Boogie Preprocessor took 55.80ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,110 INFO L158 Benchmark]: RCFGBuilder took 1785.98ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 81.0MB in the beginning and 79.4MB in the end (delta: 1.6MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,110 INFO L158 Benchmark]: TraceAbstraction took 63807.75ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 78.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 671.9MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,111 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:29:37,112 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.23ms. Allocated memory is still 104.9MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 891.87ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 86.3MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.69ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 83.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.80ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1785.98ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 81.0MB in the beginning and 79.4MB in the end (delta: 1.6MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 63807.75ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 78.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 671.9MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3s, 191 PlacesBefore, 88 PlacesAfterwards, 183 TransitionsBefore, 79 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 8 FixpointIterations, 74 TrivialSequentialCompositions, 101 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 180 TotalNumberOfCompositions, 33616 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13528, independent: 12998, independent conditional: 0, independent unconditional: 12998, dependent: 436, dependent conditional: 0, dependent unconditional: 436, unknown: 94, unknown conditional: 0, unknown unconditional: 94] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4794, independent: 4686, independent conditional: 0, independent unconditional: 4686, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4794, independent: 4066, independent conditional: 0, independent unconditional: 4066, dependent: 728, dependent conditional: 0, dependent unconditional: 728, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 728, independent: 620, independent conditional: 0, independent unconditional: 620, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3376, independent: 2275, independent conditional: 0, independent unconditional: 2275, dependent: 762, dependent conditional: 0, dependent unconditional: 762, unknown: 339, unknown conditional: 0, unknown unconditional: 339] ], Cache Queries: [ total: 13528, independent: 8312, independent conditional: 0, independent unconditional: 8312, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 4871, unknown conditional: 0, unknown unconditional: 4871] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 766, Positive conditional cache size: 0, Positive unconditional cache size: 766, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2257, ((void *)0), P0, ((void *)0))=-3, t2257={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2258, ((void *)0), P1, ((void *)0))=-2, t2257={7:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2259, ((void *)0), P2, ((void *)0))=-1, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 \read(x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L759] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=2, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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, 244 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 63.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.2s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 24.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1044 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1044 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4542 IncrementalHoareTripleChecker+Invalid, 4815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 54 mSDtfsCounter, 4542 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54796occurred in iteration=0, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 4639 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 4641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 09:29:37,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/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 cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- 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 09:29:39,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:29:39,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:29:39,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:29:39,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:29:39,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:29:39,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:29:39,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:29:39,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:29:39,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:29:39,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:29:39,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:29:39,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:29:39,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:29:39,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:29:39,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:29:39,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:29:39,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:29:39,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:29:39,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:29:39,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:29:39,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:29:39,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:29:39,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:29:39,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:29:39,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:29:39,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:29:39,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:29:39,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:29:39,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:29:39,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:29:39,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:29:39,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:29:39,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:29:39,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:29:39,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:29:39,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:29:39,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:29:39,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:29:39,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:29:39,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:29:39,900 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 09:29:39,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:29:39,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:29:39,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:29:39,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:29:39,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:29:39,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:29:39,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:29:39,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:29:39,942 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:29:39,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:29:39,944 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:29:39,944 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:29:39,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:29:39,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:29:39,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:29:39,945 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:29:39,946 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:29:39,946 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:29:39,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:29:39,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:29:39,947 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:29:39,947 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:29:39,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:29:39,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:29:39,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:29:39,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:29:39,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:29:39,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:39,949 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:29:39,949 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:29:39,950 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:29:39,950 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:29:39,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:29:39,951 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_be662580-cc63-48da-a68e-599416e7e6bf/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_be662580-cc63-48da-a68e-599416e7e6bf/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 -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-11-20 09:29:40,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:29:40,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:29:40,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:29:40,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:29:40,418 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:29:40,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-20 09:29:43,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:29:43,794 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:29:43,795 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-20 09:29:43,808 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data/19fb3ae10/d8987d51a383453f938c5877b577fbc8/FLAG9ab96ecc3 [2022-11-20 09:29:43,827 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/data/19fb3ae10/d8987d51a383453f938c5877b577fbc8 [2022-11-20 09:29:43,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:29:43,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:29:43,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:29:43,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:29:43,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:29:43,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:43" (1/1) ... [2022-11-20 09:29:43,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b86801d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:43, skipping insertion in model container [2022-11-20 09:29:43,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:43" (1/1) ... [2022-11-20 09:29:43,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:29:43,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:29:44,075 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_be662580-cc63-48da-a68e-599416e7e6bf/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-20 09:29:44,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:29:44,422 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:29:44,436 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_be662580-cc63-48da-a68e-599416e7e6bf/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-20 09:29:44,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:29:44,523 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:29:44,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44 WrapperNode [2022-11-20 09:29:44,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:29:44,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:29:44,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:29:44,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:29:44,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,603 INFO L138 Inliner]: procedures = 180, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-11-20 09:29:44,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:29:44,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:29:44,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:29:44,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:29:44,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,642 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:29:44,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:29:44,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:29:44,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:29:44,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (1/1) ... [2022-11-20 09:29:44,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:44,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:44,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:29:44,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:29:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 09:29:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:29:44,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:29:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:29:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:29:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 09:29:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:29:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 09:29:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:29:44,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:29:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:29:44,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:29:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:29:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:29:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:29:44,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:29:44,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:29:44,789 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 09:29:45,043 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:29:45,045 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:29:45,825 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:29:46,686 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:29:46,686 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:29:46,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:46 BoogieIcfgContainer [2022-11-20 09:29:46,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:29:46,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:29:46,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:29:46,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:29:46,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:29:43" (1/3) ... [2022-11-20 09:29:46,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:46, skipping insertion in model container [2022-11-20 09:29:46,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:44" (2/3) ... [2022-11-20 09:29:46,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:46, skipping insertion in model container [2022-11-20 09:29:46,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:46" (3/3) ... [2022-11-20 09:29:46,704 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-11-20 09:29:46,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:29:46,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-20 09:29:46,726 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:29:46,945 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:29:46,982 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:29:46,998 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 184 transitions, 383 flow [2022-11-20 09:29:47,002 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 184 transitions, 383 flow [2022-11-20 09:29:47,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 184 transitions, 383 flow [2022-11-20 09:29:47,163 INFO L130 PetriNetUnfolder]: 2/181 cut-off events. [2022-11-20 09:29:47,164 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:29:47,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 2/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 295 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-20 09:29:47,178 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512 [2022-11-20 09:30:08,249 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 189 DAG size of output: 186 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 09:30:18,334 WARN L233 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 219 DAG size of output: 216 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 09:30:44,509 INFO L134 LiptonReduction]: Checked pairs total: 34301 [2022-11-20 09:30:44,510 INFO L136 LiptonReduction]: Total number of compositions: 181 [2022-11-20 09:30:44,528 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 173 flow [2022-11-20 09:30:46,836 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 09:30:46,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:30:46,903 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;@359ddf4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:30:46,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2022-11-20 09:30:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states 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 09:30:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:30:47,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:47,281 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:30:47,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1231, now seen corresponding path program 1 times [2022-11-20 09:30:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:47,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112401706] [2022-11-20 09:30:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:47,318 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 09:30:47,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:47,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:47,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:47,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:30:47,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:47,657 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 09:30:47,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:47,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:47,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112401706] [2022-11-20 09:30:47,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112401706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:47,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:47,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:30:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910073] [2022-11-20 09:30:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:47,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:30:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:30:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:30:47,777 INFO L87 Difference]: Start difference. First operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 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 09:30:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:48,343 INFO L93 Difference]: Finished difference Result 9084 states and 32205 transitions. [2022-11-20 09:30:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:30:48,346 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 09:30:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:48,527 INFO L225 Difference]: With dead ends: 9084 [2022-11-20 09:30:48,528 INFO L226 Difference]: Without dead ends: 9084 [2022-11-20 09:30:48,528 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 09:30:48,533 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:48,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:30:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-11-20 09:30:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9084. [2022-11-20 09:30:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7951 states have (on average 4.050433907684568) internal successors, (32205), 9083 states have internal predecessors, (32205), 0 states have call successors, (0), 0 states 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 09:30:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 32205 transitions. [2022-11-20 09:30:49,496 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 32205 transitions. Word has length 1 [2022-11-20 09:30:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:49,497 INFO L495 AbstractCegarLoop]: Abstraction has 9084 states and 32205 transitions. [2022-11-20 09:30:49,497 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 09:30:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 32205 transitions. [2022-11-20 09:30:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 09:30:49,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:49,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 09:30:49,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:49,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:49,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 37749044, now seen corresponding path program 1 times [2022-11-20 09:30:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:49,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960953661] [2022-11-20 09:30:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:49,711 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 09:30:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:49,717 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:49,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:49,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:30:49,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:50,058 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 09:30:50,059 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 09:30:50,091 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 09:30:50,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:50,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960953661] [2022-11-20 09:30:50,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960953661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:50,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:50,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:30:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041406685] [2022-11-20 09:30:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:50,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:50,095 INFO L87 Difference]: Start difference. First operand 9084 states and 32205 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:50,506 INFO L93 Difference]: Finished difference Result 5010 states and 17211 transitions. [2022-11-20 09:30:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:50,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 09:30:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:50,551 INFO L225 Difference]: With dead ends: 5010 [2022-11-20 09:30:50,551 INFO L226 Difference]: Without dead ends: 5010 [2022-11-20 09:30:50,552 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 09:30:50,553 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:50,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:30:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2022-11-20 09:30:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 5010. [2022-11-20 09:30:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 4599 states have (on average 3.742335290280496) internal successors, (17211), 5009 states have internal predecessors, (17211), 0 states have call successors, (0), 0 states 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 09:30:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 17211 transitions. [2022-11-20 09:30:50,817 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 17211 transitions. Word has length 4 [2022-11-20 09:30:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:50,818 INFO L495 AbstractCegarLoop]: Abstraction has 5010 states and 17211 transitions. [2022-11-20 09:30:50,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 17211 transitions. [2022-11-20 09:30:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 09:30:50,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:50,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 09:30:50,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:51,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:51,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 37749045, now seen corresponding path program 1 times [2022-11-20 09:30:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:51,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327379759] [2022-11-20 09:30:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:51,033 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 09:30:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:51,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:51,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:51,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:30:51,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:51,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:51,314 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 09:30:51,368 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 09:30:51,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:51,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:51,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327379759] [2022-11-20 09:30:51,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327379759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:51,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:51,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:30:51,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288024357] [2022-11-20 09:30:51,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:51,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:51,375 INFO L87 Difference]: Start difference. First operand 5010 states and 17211 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:51,747 INFO L93 Difference]: Finished difference Result 1886 states and 6165 transitions. [2022-11-20 09:30:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:51,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 09:30:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:51,773 INFO L225 Difference]: With dead ends: 1886 [2022-11-20 09:30:51,792 INFO L226 Difference]: Without dead ends: 1886 [2022-11-20 09:30:51,793 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 09:30:51,794 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:30:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-11-20 09:30:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2022-11-20 09:30:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1817 states have (on average 3.3929554210236654) internal successors, (6165), 1885 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states 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 09:30:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6165 transitions. [2022-11-20 09:30:51,907 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6165 transitions. Word has length 4 [2022-11-20 09:30:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:51,908 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 6165 transitions. [2022-11-20 09:30:51,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6165 transitions. [2022-11-20 09:30:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 09:30:51,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:51,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 09:30:51,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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)] Ended with exit code 0 [2022-11-20 09:30:52,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:52,122 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1917738698, now seen corresponding path program 1 times [2022-11-20 09:30:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:52,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931742418] [2022-11-20 09:30:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:52,124 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 09:30:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:52,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:52,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:52,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:30:52,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:52,489 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 09:30:52,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:52,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931742418] [2022-11-20 09:30:52,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931742418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:52,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:52,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:30:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104461579] [2022-11-20 09:30:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:52,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:52,496 INFO L87 Difference]: Start difference. First operand 1886 states and 6165 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 09:30:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:52,866 INFO L93 Difference]: Finished difference Result 1574 states and 5087 transitions. [2022-11-20 09:30:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:52,867 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 09:30:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:52,875 INFO L225 Difference]: With dead ends: 1574 [2022-11-20 09:30:52,876 INFO L226 Difference]: Without dead ends: 1574 [2022-11-20 09:30:52,877 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 09:30:52,880 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:52,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:30:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-11-20 09:30:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2022-11-20 09:30:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1524 states have (on average 3.3379265091863517) internal successors, (5087), 1573 states have internal predecessors, (5087), 0 states have call successors, (0), 0 states 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 09:30:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 5087 transitions. [2022-11-20 09:30:52,940 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 5087 transitions. Word has length 6 [2022-11-20 09:30:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:52,941 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 5087 transitions. [2022-11-20 09:30:52,941 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 09:30:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 5087 transitions. [2022-11-20 09:30:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 09:30:52,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:53,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:53,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:53,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:53,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash -683867899, now seen corresponding path program 1 times [2022-11-20 09:30:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:53,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199042614] [2022-11-20 09:30:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:53,226 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 09:30:53,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:53,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:53,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:53,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:30:53,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:53,523 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 09:30:53,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:53,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199042614] [2022-11-20 09:30:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199042614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:53,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:30:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222790969] [2022-11-20 09:30:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:53,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:30:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:53,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:30:53,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:53,526 INFO L87 Difference]: Start difference. First operand 1574 states and 5087 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 09:30:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:53,772 INFO L93 Difference]: Finished difference Result 1542 states and 4975 transitions. [2022-11-20 09:30:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:30:53,773 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 09:30:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:53,782 INFO L225 Difference]: With dead ends: 1542 [2022-11-20 09:30:53,782 INFO L226 Difference]: Without dead ends: 1542 [2022-11-20 09:30:53,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:30:53,784 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:53,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:30:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-11-20 09:30:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2022-11-20 09:30:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1492 states have (on average 3.334450402144772) internal successors, (4975), 1541 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states 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 09:30:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 4975 transitions. [2022-11-20 09:30:53,875 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 4975 transitions. Word has length 10 [2022-11-20 09:30:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:53,877 INFO L495 AbstractCegarLoop]: Abstraction has 1542 states and 4975 transitions. [2022-11-20 09:30:53,877 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 09:30:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 4975 transitions. [2022-11-20 09:30:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:30:53,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:53,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:53,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:54,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:54,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash 274930400, now seen corresponding path program 1 times [2022-11-20 09:30:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:54,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461616759] [2022-11-20 09:30:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:54,092 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 09:30:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:54,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:54,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:54,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:30:54,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:55,597 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 09:30:55,620 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 09:30:55,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:55,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:55,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461616759] [2022-11-20 09:30:55,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461616759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:55,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:55,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048207843] [2022-11-20 09:30:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:55,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:30:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:55,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:30:55,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:30:55,623 INFO L87 Difference]: Start difference. First operand 1542 states and 4975 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 09:30:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:56,055 INFO L93 Difference]: Finished difference Result 2190 states and 7051 transitions. [2022-11-20 09:30:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:30:56,056 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 09:30:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:56,068 INFO L225 Difference]: With dead ends: 2190 [2022-11-20 09:30:56,069 INFO L226 Difference]: Without dead ends: 2190 [2022-11-20 09:30:56,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 09:30:56,070 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:56,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:30:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2022-11-20 09:30:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1478. [2022-11-20 09:30:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1429 states have (on average 3.3358992302309307) internal successors, (4767), 1477 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states 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 09:30:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 4767 transitions. [2022-11-20 09:30:56,142 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 4767 transitions. Word has length 11 [2022-11-20 09:30:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:56,143 INFO L495 AbstractCegarLoop]: Abstraction has 1478 states and 4767 transitions. [2022-11-20 09:30:56,143 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 09:30:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 4767 transitions. [2022-11-20 09:30:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:30:56,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:56,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:56,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:56,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:56,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash 274930406, now seen corresponding path program 1 times [2022-11-20 09:30:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:56,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656943982] [2022-11-20 09:30:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:56,359 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 09:30:56,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:56,361 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:56,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:56,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:30:56,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:56,694 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 09:30:56,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:56,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656943982] [2022-11-20 09:30:56,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656943982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:56,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:56,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:30:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617004392] [2022-11-20 09:30:56,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:56,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:30:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:30:56,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:30:56,698 INFO L87 Difference]: Start difference. First operand 1478 states and 4767 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 09:30:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:57,049 INFO L93 Difference]: Finished difference Result 828 states and 2174 transitions. [2022-11-20 09:30:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:30:57,050 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 09:30:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:57,054 INFO L225 Difference]: With dead ends: 828 [2022-11-20 09:30:57,054 INFO L226 Difference]: Without dead ends: 748 [2022-11-20 09:30:57,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 09:30:57,056 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:57,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:30:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-20 09:30:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2022-11-20 09:30:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 711 states have (on average 2.748241912798875) internal successors, (1954), 747 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states 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 09:30:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1954 transitions. [2022-11-20 09:30:57,086 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1954 transitions. Word has length 11 [2022-11-20 09:30:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:57,087 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1954 transitions. [2022-11-20 09:30:57,087 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 09:30:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1954 transitions. [2022-11-20 09:30:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:30:57,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:57,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:57,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:57,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:57,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash -746818903, now seen corresponding path program 1 times [2022-11-20 09:30:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:57,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235745727] [2022-11-20 09:30:57,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:57,314 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 09:30:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:57,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:57,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:57,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:30:57,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:57,739 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 09:30:57,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:57,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:57,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235745727] [2022-11-20 09:30:57,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235745727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:57,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:57,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:30:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855580009] [2022-11-20 09:30:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:57,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:30:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:57,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:30:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:30:57,743 INFO L87 Difference]: Start difference. First operand 748 states and 1954 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:58,250 INFO L93 Difference]: Finished difference Result 304 states and 655 transitions. [2022-11-20 09:30:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:30:58,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:30:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:58,252 INFO L225 Difference]: With dead ends: 304 [2022-11-20 09:30:58,252 INFO L226 Difference]: Without dead ends: 260 [2022-11-20 09:30:58,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:30:58,253 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:58,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 9 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:30:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-20 09:30:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-11-20 09:30:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 245 states have (on average 2.2285714285714286) internal successors, (546), 259 states have internal predecessors, (546), 0 states have call successors, (0), 0 states 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 09:30:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 546 transitions. [2022-11-20 09:30:58,263 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 546 transitions. Word has length 14 [2022-11-20 09:30:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:58,263 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 546 transitions. [2022-11-20 09:30:58,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 546 transitions. [2022-11-20 09:30:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:30:58,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:58,265 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 09:30:58,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:58,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:58,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash -604422339, now seen corresponding path program 1 times [2022-11-20 09:30:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:58,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836955137] [2022-11-20 09:30:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:58,479 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 09:30:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:58,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:58,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:58,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:30:58,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:58,868 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 09:30:58,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:30:58,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:30:58,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836955137] [2022-11-20 09:30:58,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836955137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:30:58,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:30:58,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:30:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006086029] [2022-11-20 09:30:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:30:58,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:30:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:30:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:30:58,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:30:58,872 INFO L87 Difference]: Start difference. First operand 260 states and 546 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 09:30:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:59,541 INFO L93 Difference]: Finished difference Result 161 states and 355 transitions. [2022-11-20 09:30:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:30:59,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 09:30:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:59,542 INFO L225 Difference]: With dead ends: 161 [2022-11-20 09:30:59,543 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 09:30:59,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:30:59,544 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:59,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:30:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 09:30:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-20 09:30:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-11-20 09:30:59,550 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 17 [2022-11-20 09:30:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:59,551 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-11-20 09:30:59,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 09:30:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-11-20 09:30:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:30:59,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:59,553 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 09:30:59,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:59,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:59,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:30:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash 561321407, now seen corresponding path program 1 times [2022-11-20 09:30:59,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:30:59,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907075090] [2022-11-20 09:30:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:59,769 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 09:30:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:30:59,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:30:59,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:00,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:31:00,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:14,457 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 09:31:14,573 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 09:31:14,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:14,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:31:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907075090] [2022-11-20 09:31:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907075090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:14,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:14,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:31:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907857571] [2022-11-20 09:31:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:14,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:31:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:31:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:31:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:14,575 INFO L87 Difference]: Start difference. First operand 150 states and 335 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 09:31:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:15,036 INFO L93 Difference]: Finished difference Result 173 states and 394 transitions. [2022-11-20 09:31:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:15,037 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 09:31:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:15,038 INFO L225 Difference]: With dead ends: 173 [2022-11-20 09:31:15,038 INFO L226 Difference]: Without dead ends: 173 [2022-11-20 09:31:15,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:31:15,039 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:15,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:31:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-20 09:31:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2022-11-20 09:31:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-11-20 09:31:15,045 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-11-20 09:31:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:15,045 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-11-20 09:31:15,046 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 09:31:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-11-20 09:31:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:31:15,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:15,047 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 09:31:15,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:15,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:15,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:31:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash 221095577, now seen corresponding path program 1 times [2022-11-20 09:31:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:15,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28819629] [2022-11-20 09:31:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:15,263 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 09:31:15,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:15,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:15,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:15,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:31:15,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:15,795 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 11 treesize of output 7 [2022-11-20 09:31:16,039 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 15 treesize of output 7 [2022-11-20 09:31:16,085 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 09:31:16,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:16,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:31:16,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28819629] [2022-11-20 09:31:16,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28819629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:16,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:31:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986412461] [2022-11-20 09:31:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:31:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:31:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:31:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:16,088 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 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 09:31:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:16,922 INFO L93 Difference]: Finished difference Result 277 states and 588 transitions. [2022-11-20 09:31:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:16,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 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 09:31:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:16,924 INFO L225 Difference]: With dead ends: 277 [2022-11-20 09:31:16,924 INFO L226 Difference]: Without dead ends: 277 [2022-11-20 09:31:16,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:16,925 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:16,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 17 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:31:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-20 09:31:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 215. [2022-11-20 09:31:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 2.2300469483568075) internal successors, (475), 214 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 09:31:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 475 transitions. [2022-11-20 09:31:16,934 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 475 transitions. Word has length 21 [2022-11-20 09:31:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:16,935 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 475 transitions. [2022-11-20 09:31:16,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 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 09:31:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 475 transitions. [2022-11-20 09:31:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:31:16,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:16,936 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 09:31:16,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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)] Ended with exit code 0 [2022-11-20 09:31:17,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:17,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:31:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -342593613, now seen corresponding path program 2 times [2022-11-20 09:31:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:17,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790515948] [2022-11-20 09:31:17,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:31:17,168 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 09:31:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:17,170 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:17,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:17,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:31:17,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:17,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:31:17,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:17,531 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 09:31:17,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:17,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:31:17,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790515948] [2022-11-20 09:31:17,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790515948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:17,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:17,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986968696] [2022-11-20 09:31:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:17,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:31:17,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:17,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:17,534 INFO L87 Difference]: Start difference. First operand 215 states and 475 transitions. Second operand has 3 states, 2 states have (on average 10.5) 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 09:31:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:17,737 INFO L93 Difference]: Finished difference Result 280 states and 600 transitions. [2022-11-20 09:31:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:17,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) 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 09:31:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:17,739 INFO L225 Difference]: With dead ends: 280 [2022-11-20 09:31:17,739 INFO L226 Difference]: Without dead ends: 280 [2022-11-20 09:31:17,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 09:31:17,741 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:17,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-20 09:31:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 208. [2022-11-20 09:31:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 2.2524271844660193) internal successors, (464), 207 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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 09:31:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 464 transitions. [2022-11-20 09:31:17,749 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 464 transitions. Word has length 21 [2022-11-20 09:31:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:17,749 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 464 transitions. [2022-11-20 09:31:17,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) 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 09:31:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 464 transitions. [2022-11-20 09:31:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:31:17,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:17,751 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 09:31:17,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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)] Ended with exit code 0 [2022-11-20 09:31:17,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:17,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:31:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:17,967 INFO L85 PathProgramCache]: Analyzing trace with hash 129565529, now seen corresponding path program 3 times [2022-11-20 09:31:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:17,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556594486] [2022-11-20 09:31:17,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:31:17,968 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 09:31:17,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:17,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:17,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:18,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 09:31:18,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:18,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 09:31:18,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:18,501 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 11 treesize of output 7 [2022-11-20 09:31:20,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 36 [2022-11-20 09:31:20,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-20 09:31:20,514 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 15 treesize of output 7 [2022-11-20 09:31:20,556 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 09:31:20,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:20,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:31:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556594486] [2022-11-20 09:31:20,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556594486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:20,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:20,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:31:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779700545] [2022-11-20 09:31:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:31:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:31:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:31:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:20,559 INFO L87 Difference]: Start difference. First operand 208 states and 464 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 09:31:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:21,427 INFO L93 Difference]: Finished difference Result 361 states and 755 transitions. [2022-11-20 09:31:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 09:31:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:21,429 INFO L225 Difference]: With dead ends: 361 [2022-11-20 09:31:21,430 INFO L226 Difference]: Without dead ends: 361 [2022-11-20 09:31:21,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:21,431 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:21,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 17 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:31:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-20 09:31:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 206. [2022-11-20 09:31:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 204 states have (on average 2.25) internal successors, (459), 205 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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 09:31:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 459 transitions. [2022-11-20 09:31:21,439 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 459 transitions. Word has length 21 [2022-11-20 09:31:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:21,439 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 459 transitions. [2022-11-20 09:31:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 09:31:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 459 transitions. [2022-11-20 09:31:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:31:21,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:21,441 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 09:31:21,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:21,651 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:31:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -404505157, now seen corresponding path program 4 times [2022-11-20 09:31:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386898224] [2022-11-20 09:31:21,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:31:21,652 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 09:31:21,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:21,653 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:21,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 (15)] Waiting until timeout for monitored process [2022-11-20 09:31:21,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:31:21,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:21,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 09:31:21,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:25,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 147 [2022-11-20 09:31:25,269 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 101 treesize of output 97 [2022-11-20 09:31:25,303 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 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 09:31:25,468 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 8 treesize of output 1 [2022-11-20 09:31:25,528 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 5 treesize of output 3 [2022-11-20 09:31:26,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 107 treesize of output 95 [2022-11-20 09:31:27,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 133 [2022-11-20 09:31:27,659 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 8 treesize of output 1 [2022-11-20 09:31:28,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 68 treesize of output 48 [2022-11-20 09:31:28,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-20 09:31:29,062 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 09:31:29,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:29,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:31:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386898224] [2022-11-20 09:31:29,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386898224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:29,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:29,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:31:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571581522] [2022-11-20 09:31:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:31:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:31:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:31:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:31:29,065 INFO L87 Difference]: Start difference. First operand 206 states and 459 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:31:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:30,824 INFO L93 Difference]: Finished difference Result 313 states and 661 transitions. [2022-11-20 09:31:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:30,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:31:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:30,827 INFO L225 Difference]: With dead ends: 313 [2022-11-20 09:31:30,827 INFO L226 Difference]: Without dead ends: 313 [2022-11-20 09:31:30,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:31:30,828 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:30,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-20 09:31:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-20 09:31:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 202. [2022-11-20 09:31:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.245) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 09:31:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions. [2022-11-20 09:31:30,841 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21 [2022-11-20 09:31:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:30,842 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions. [2022-11-20 09:31:30,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 09:31:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions. [2022-11-20 09:31:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:31:30,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:30,843 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 09:31:30,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 (15)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:31,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:31,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-20 09:31:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash 346242555, now seen corresponding path program 5 times [2022-11-20 09:31:31,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:31,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828126810] [2022-11-20 09:31:31,056 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:31:31,056 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 09:31:31,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:31,057 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:31,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 (16)] Waiting until timeout for monitored process [2022-11-20 09:31:31,443 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:31:31,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:31:31,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:31:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:31,783 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 09:31:31,783 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:31:31,784 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2022-11-20 09:31:31,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2022-11-20 09:31:31,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2022-11-20 09:31:31,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2022-11-20 09:31:31,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2022-11-20 09:31:31,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2022-11-20 09:31:31,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2022-11-20 09:31:31,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2022-11-20 09:31:31,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2022-11-20 09:31:31,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2022-11-20 09:31:31,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2022-11-20 09:31:31,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2022-11-20 09:31:31,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2022-11-20 09:31:31,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2022-11-20 09:31:31,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2022-11-20 09:31:31,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2022-11-20 09:31:31,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2022-11-20 09:31:31,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2022-11-20 09:31:31,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2022-11-20 09:31:31,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2022-11-20 09:31:31,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2022-11-20 09:31:31,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2022-11-20 09:31:31,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2022-11-20 09:31:31,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2022-11-20 09:31:31,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2022-11-20 09:31:31,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2022-11-20 09:31:31,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2022-11-20 09:31:31,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2022-11-20 09:31:31,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2022-11-20 09:31:31,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2022-11-20 09:31:31,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2022-11-20 09:31:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2022-11-20 09:31:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2022-11-20 09:31:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2022-11-20 09:31:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2022-11-20 09:31:31,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2022-11-20 09:31:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2022-11-20 09:31:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2022-11-20 09:31:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2022-11-20 09:31:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2022-11-20 09:31:31,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2022-11-20 09:31:31,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2022-11-20 09:31:31,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2022-11-20 09:31:31,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2022-11-20 09:31:31,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2022-11-20 09:31:31,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2022-11-20 09:31:31,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2022-11-20 09:31:31,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2022-11-20 09:31:31,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2022-11-20 09:31:31,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2022-11-20 09:31:31,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2022-11-20 09:31:31,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2022-11-20 09:31:31,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2022-11-20 09:31:31,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2022-11-20 09:31:31,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2022-11-20 09:31:31,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2022-11-20 09:31:31,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2022-11-20 09:31:31,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2022-11-20 09:31:31,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2022-11-20 09:31:31,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2022-11-20 09:31:31,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2022-11-20 09:31:31,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2022-11-20 09:31:31,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2022-11-20 09:31:31,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2022-11-20 09:31:31,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2022-11-20 09:31:31,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2022-11-20 09:31:31,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2022-11-20 09:31:31,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2022-11-20 09:31:31,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2022-11-20 09:31:31,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2022-11-20 09:31:31,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2022-11-20 09:31:31,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2022-11-20 09:31:31,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2022-11-20 09:31:31,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2022-11-20 09:31:31,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2022-11-20 09:31:31,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2022-11-20 09:31:31,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2022-11-20 09:31:31,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2022-11-20 09:31:31,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2022-11-20 09:31:31,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2022-11-20 09:31:31,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2022-11-20 09:31:31,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2022-11-20 09:31:31,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2022-11-20 09:31:31,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2022-11-20 09:31:31,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2022-11-20 09:31:31,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2022-11-20 09:31:31,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2022-11-20 09:31:31,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2022-11-20 09:31:31,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2022-11-20 09:31:31,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2022-11-20 09:31:31,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2022-11-20 09:31:31,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 (16)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:32,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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 09:31:32,026 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:32,032 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:31:32,033 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:31:32,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:31:32 BasicIcfg [2022-11-20 09:31:32,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:31:32,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:31:32,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:31:32,184 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:31:32,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:46" (3/4) ... [2022-11-20 09:31:32,187 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:31:32,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:31:32,194 INFO L158 Benchmark]: Toolchain (without parser) took 108353.28ms. Allocated memory was 69.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 40.2MB in the beginning and 826.3MB in the end (delta: -786.1MB). Peak memory consumption was 508.7MB. Max. memory is 16.1GB. [2022-11-20 09:31:32,194 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:32,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 684.67ms. Allocated memory is still 69.2MB. Free memory was 40.0MB in the beginning and 35.2MB in the end (delta: 4.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-11-20 09:31:32,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.28ms. Allocated memory is still 69.2MB. Free memory was 35.2MB in the beginning and 32.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:32,196 INFO L158 Benchmark]: Boogie Preprocessor took 45.80ms. Allocated memory is still 69.2MB. Free memory was 32.6MB in the beginning and 29.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:31:32,197 INFO L158 Benchmark]: RCFGBuilder took 2038.23ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 29.7MB in the beginning and 53.1MB in the end (delta: -23.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-20 09:31:32,198 INFO L158 Benchmark]: TraceAbstraction took 105491.04ms. Allocated memory was 100.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 52.4MB in the beginning and 827.3MB in the end (delta: -775.0MB). Peak memory consumption was 489.3MB. Max. memory is 16.1GB. [2022-11-20 09:31:32,198 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 1.4GB. Free memory was 827.3MB in the beginning and 826.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:32,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 69.2MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 684.67ms. Allocated memory is still 69.2MB. Free memory was 40.0MB in the beginning and 35.2MB in the end (delta: 4.7MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.28ms. Allocated memory is still 69.2MB. Free memory was 35.2MB in the beginning and 32.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.80ms. Allocated memory is still 69.2MB. Free memory was 32.6MB in the beginning and 29.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2038.23ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 29.7MB in the beginning and 53.1MB in the end (delta: -23.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 105491.04ms. Allocated memory was 100.7MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 52.4MB in the beginning and 827.3MB in the end (delta: -775.0MB). Peak memory consumption was 489.3MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 1.4GB. Free memory was 827.3MB in the beginning and 826.3MB 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: 57.5s, 192 PlacesBefore, 88 PlacesAfterwards, 184 TransitionsBefore, 79 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 105 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 181 TotalNumberOfCompositions, 34301 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14285, independent: 13741, independent conditional: 0, independent unconditional: 13741, dependent: 469, dependent conditional: 0, dependent unconditional: 469, unknown: 75, unknown conditional: 0, unknown unconditional: 75] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4814, independent: 4694, independent conditional: 0, independent unconditional: 4694, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4814, independent: 4080, independent conditional: 0, independent unconditional: 4080, dependent: 734, dependent conditional: 0, dependent unconditional: 734, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 734, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5682, independent: 3260, independent conditional: 0, independent unconditional: 3260, dependent: 1641, dependent conditional: 0, dependent unconditional: 1641, unknown: 781, unknown conditional: 0, unknown unconditional: 781] ], Cache Queries: [ total: 14285, independent: 9047, independent conditional: 0, independent unconditional: 9047, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 4872, unknown conditional: 0, unknown unconditional: 4872] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 886, Positive conditional cache size: 0, Positive unconditional cache size: 886, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2257, ((void *)0), P0, ((void *)0))=-2, t2257={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2258, ((void *)0), P1, ((void *)0))=-1, t2257={7:0}, t2258={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={14:0}, t2259={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2259, ((void *)0), P2, ((void *)0))=0, t2257={7:0}, t2258={14:0}, t2259={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 \read(x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L759] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={14:0}, t2259={15:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=3, weak$$choice1=2, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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, 245 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 105.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.4s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1925 IncrementalHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 31 mSDtfsCounter, 1925 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54796occurred in iteration=0, InterpolantAutomatonStates: 68, 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, 14 MinimizatonAttempts, 1136 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 2133 SizeOfPredicates, 87 NumberOfNonLiveVariables, 2168 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 09:31:32,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be662580-cc63-48da-a68e-599416e7e6bf/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