./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:55:06,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:55:07,005 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:55:07,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:55:07,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:55:07,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:55:07,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:55:07,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:55:07,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:55:07,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:55:07,044 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:55:07,045 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:55:07,045 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:55:07,045 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:55:07,046 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:55:07,046 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:55:07,046 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:55:07,046 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:55:07,047 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:55:07,047 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:55:07,047 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:55:07,049 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:55:07,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:55:07,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:55:07,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:55:07,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:55:07,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:55:07,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:55:07,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:55:07,052 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:55:07,052 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:55:07,056 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:55:07,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:55:07,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:55:07,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:55:07,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:55:07,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:55:07,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:55:07,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:55:07,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:55:07,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:55:07,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:55:07,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:55:07,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:55:07,063 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:55:07,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:55:07,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:55:07,064 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:55:07,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:55:07,065 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/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_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab [2024-11-09 05:55:07,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:55:07,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:55:07,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:55:07,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:55:07,384 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:55:07,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i Unable to find full path for "g++" [2024-11-09 05:55:09,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:55:09,680 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:55:09,681 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2024-11-09 05:55:09,707 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data/72d8565de/0bf63c9c355342d5adf3db03d4727b5a/FLAGa86ebaa71 [2024-11-09 05:55:09,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data/72d8565de/0bf63c9c355342d5adf3db03d4727b5a [2024-11-09 05:55:09,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:55:09,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:55:09,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:55:09,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:55:09,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:55:09,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:55:09" (1/1) ... [2024-11-09 05:55:09,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606b9694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:09, skipping insertion in model container [2024-11-09 05:55:09,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:55:09" (1/1) ... [2024-11-09 05:55:09,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:55:10,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:55:10,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:55:10,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:55:10,499 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:55:10,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10 WrapperNode [2024-11-09 05:55:10,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:55:10,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:55:10,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:55:10,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:55:10,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,568 INFO L138 Inliner]: procedures = 175, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2024-11-09 05:55:10,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:55:10,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:55:10,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:55:10,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:55:10,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:55:10,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:55:10,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:55:10,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:55:10,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (1/1) ... [2024-11-09 05:55:10,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:55:10,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:55:10,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:55:10,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:55:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:55:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:55:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 05:55:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:55:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 05:55:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 05:55:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 05:55:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 05:55:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 05:55:10,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 05:55:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:55:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 05:55:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:55:10,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:55:10,732 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 05:55:10,968 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:55:10,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:55:11,685 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 05:55:11,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:55:12,730 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:55:12,730 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:55:12,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:12 BoogieIcfgContainer [2024-11-09 05:55:12,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:55:12,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:55:12,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:55:12,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:55:12,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:55:09" (1/3) ... [2024-11-09 05:55:12,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff289fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:55:12, skipping insertion in model container [2024-11-09 05:55:12,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:10" (2/3) ... [2024-11-09 05:55:12,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff289fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:55:12, skipping insertion in model container [2024-11-09 05:55:12,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:12" (3/3) ... [2024-11-09 05:55:12,745 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2024-11-09 05:55:12,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:55:12,765 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-11-09 05:55:12,765 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 05:55:13,022 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 05:55:13,056 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 102 transitions, 216 flow [2024-11-09 05:55:21,973 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 267906 states, 216310 states have (on average 4.798118441126162) internal successors, (1037881), 267905 states have internal predecessors, (1037881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:22,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:55:22,033 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@72e50718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:55:22,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2024-11-09 05:55:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 267906 states, 216310 states have (on average 4.798118441126162) internal successors, (1037881), 267905 states have internal predecessors, (1037881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:55:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:22,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:55:22,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:22,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 941908916, now seen corresponding path program 1 times [2024-11-09 05:55:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:22,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370447177] [2024-11-09 05:55:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:22,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:22,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370447177] [2024-11-09 05:55:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370447177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:22,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:22,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:55:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400214519] [2024-11-09 05:55:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:22,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:23,161 INFO L87 Difference]: Start difference. First operand has 267906 states, 216310 states have (on average 4.798118441126162) internal successors, (1037881), 267905 states have internal predecessors, (1037881), 0 states have call successors, (0), 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 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) [2024-11-09 05:55:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:29,138 INFO L93 Difference]: Finished difference Result 271830 states and 1064403 transitions. [2024-11-09 05:55:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:29,141 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 [2024-11-09 05:55:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:29,737 INFO L225 Difference]: With dead ends: 271830 [2024-11-09 05:55:29,737 INFO L226 Difference]: Without dead ends: 18992 [2024-11-09 05:55:30,119 INFO L431 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 [2024-11-09 05:55:30,123 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:30,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:55:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18992 states. [2024-11-09 05:55:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18992 to 18992. [2024-11-09 05:55:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18992 states, 18673 states have (on average 3.695978150270444) internal successors, (69015), 18991 states have internal predecessors, (69015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18992 states to 18992 states and 69015 transitions. [2024-11-09 05:55:31,977 INFO L78 Accepts]: Start accepts. Automaton has 18992 states and 69015 transitions. Word has length 6 [2024-11-09 05:55:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:31,978 INFO L471 AbstractCegarLoop]: Abstraction has 18992 states and 69015 transitions. [2024-11-09 05:55:31,979 INFO L472 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) [2024-11-09 05:55:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18992 states and 69015 transitions. [2024-11-09 05:55:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:55:31,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:31,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:55:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:55:31,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:31,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 941908917, now seen corresponding path program 1 times [2024-11-09 05:55:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173431498] [2024-11-09 05:55:31,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:32,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173431498] [2024-11-09 05:55:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173431498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:32,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:32,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:55:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075207738] [2024-11-09 05:55:32,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:32,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:32,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:32,183 INFO L87 Difference]: Start difference. First operand 18992 states and 69015 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) [2024-11-09 05:55:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:32,494 INFO L93 Difference]: Finished difference Result 18992 states and 69015 transitions. [2024-11-09 05:55:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:32,495 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 [2024-11-09 05:55:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:32,726 INFO L225 Difference]: With dead ends: 18992 [2024-11-09 05:55:32,726 INFO L226 Difference]: Without dead ends: 6010 [2024-11-09 05:55:32,757 INFO L431 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 [2024-11-09 05:55:32,759 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:32,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:55:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2024-11-09 05:55:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 6010. [2024-11-09 05:55:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 6006 states have (on average 3.504995004995005) internal successors, (21051), 6009 states have internal predecessors, (21051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 21051 transitions. [2024-11-09 05:55:33,081 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 21051 transitions. Word has length 6 [2024-11-09 05:55:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 6010 states and 21051 transitions. [2024-11-09 05:55:33,082 INFO L472 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) [2024-11-09 05:55:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 21051 transitions. [2024-11-09 05:55:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:55:33,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:33,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:55:33,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1592364683, now seen corresponding path program 1 times [2024-11-09 05:55:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394456287] [2024-11-09 05:55:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:33,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394456287] [2024-11-09 05:55:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394456287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:33,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:33,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:55:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99638551] [2024-11-09 05:55:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:33,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:33,320 INFO L87 Difference]: Start difference. First operand 6010 states and 21051 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) [2024-11-09 05:55:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:33,527 INFO L93 Difference]: Finished difference Result 6570 states and 22469 transitions. [2024-11-09 05:55:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:33,527 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 [2024-11-09 05:55:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:33,679 INFO L225 Difference]: With dead ends: 6570 [2024-11-09 05:55:33,679 INFO L226 Difference]: Without dead ends: 5786 [2024-11-09 05:55:33,684 INFO L431 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 [2024-11-09 05:55:33,685 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:33,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2024-11-09 05:55:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5786. [2024-11-09 05:55:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5782 states have (on average 3.4961950882047734) internal successors, (20215), 5785 states have internal predecessors, (20215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 20215 transitions. [2024-11-09 05:55:34,413 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 20215 transitions. Word has length 11 [2024-11-09 05:55:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 5786 states and 20215 transitions. [2024-11-09 05:55:34,414 INFO L472 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) [2024-11-09 05:55:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 20215 transitions. [2024-11-09 05:55:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:55:34,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:34,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:34,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:55:34,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1253992924, now seen corresponding path program 1 times [2024-11-09 05:55:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341404373] [2024-11-09 05:55:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:34,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:34,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341404373] [2024-11-09 05:55:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341404373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:55:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434255405] [2024-11-09 05:55:34,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:34,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:55:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:55:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:55:34,652 INFO L87 Difference]: Start difference. First operand 5786 states and 20215 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:34,845 INFO L93 Difference]: Finished difference Result 5786 states and 20215 transitions. [2024-11-09 05:55:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:55:34,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:55:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:35,004 INFO L225 Difference]: With dead ends: 5786 [2024-11-09 05:55:35,004 INFO L226 Difference]: Without dead ends: 5506 [2024-11-09 05:55:35,007 INFO L431 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 [2024-11-09 05:55:35,008 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:35,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:55:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2024-11-09 05:55:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 5506. [2024-11-09 05:55:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5506 states, 5503 states have (on average 3.4937306923496276) internal successors, (19226), 5505 states have internal predecessors, (19226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 19226 transitions. [2024-11-09 05:55:35,319 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 19226 transitions. Word has length 13 [2024-11-09 05:55:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:35,320 INFO L471 AbstractCegarLoop]: Abstraction has 5506 states and 19226 transitions. [2024-11-09 05:55:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 19226 transitions. [2024-11-09 05:55:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:55:35,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:35,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:35,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:55:35,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:35,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1253992923, now seen corresponding path program 1 times [2024-11-09 05:55:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:35,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698545177] [2024-11-09 05:55:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:35,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698545177] [2024-11-09 05:55:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698545177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:55:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804651607] [2024-11-09 05:55:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:35,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:55:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:55:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:55:35,862 INFO L87 Difference]: Start difference. First operand 5506 states and 19226 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:36,046 INFO L93 Difference]: Finished difference Result 5506 states and 19226 transitions. [2024-11-09 05:55:36,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:55:36,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:55:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:36,179 INFO L225 Difference]: With dead ends: 5506 [2024-11-09 05:55:36,179 INFO L226 Difference]: Without dead ends: 5226 [2024-11-09 05:55:36,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:55:36,183 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:36,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 40 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:55:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2024-11-09 05:55:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 5226. [2024-11-09 05:55:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 5224 states have (on average 3.4910030627871365) internal successors, (18237), 5225 states have internal predecessors, (18237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 18237 transitions. [2024-11-09 05:55:36,462 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 18237 transitions. Word has length 13 [2024-11-09 05:55:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:36,463 INFO L471 AbstractCegarLoop]: Abstraction has 5226 states and 18237 transitions. [2024-11-09 05:55:36,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 18237 transitions. [2024-11-09 05:55:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:55:36,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:36,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:36,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:55:36,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:36,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1733421605, now seen corresponding path program 1 times [2024-11-09 05:55:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10527138] [2024-11-09 05:55:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:36,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10527138] [2024-11-09 05:55:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10527138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:36,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:36,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:55:36,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155151490] [2024-11-09 05:55:36,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:36,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:55:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:36,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:55:36,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:55:36,539 INFO L87 Difference]: Start difference. First operand 5226 states and 18237 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:36,630 INFO L93 Difference]: Finished difference Result 5226 states and 18237 transitions. [2024-11-09 05:55:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:55:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:55:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:36,791 INFO L225 Difference]: With dead ends: 5226 [2024-11-09 05:55:36,791 INFO L226 Difference]: Without dead ends: 4050 [2024-11-09 05:55:36,796 INFO L431 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 [2024-11-09 05:55:36,799 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:36,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:55:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2024-11-09 05:55:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 4050. [2024-11-09 05:55:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 4049 states have (on average 3.4615954556680664) internal successors, (14016), 4049 states have internal predecessors, (14016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 14016 transitions. [2024-11-09 05:55:37,396 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 14016 transitions. Word has length 15 [2024-11-09 05:55:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 4050 states and 14016 transitions. [2024-11-09 05:55:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 14016 transitions. [2024-11-09 05:55:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:55:37,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:37,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:37,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:55:37,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1733422752, now seen corresponding path program 1 times [2024-11-09 05:55:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:37,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270621990] [2024-11-09 05:55:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:37,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270621990] [2024-11-09 05:55:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270621990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:37,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:55:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717334049] [2024-11-09 05:55:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:37,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:55:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:55:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:55:37,753 INFO L87 Difference]: Start difference. First operand 4050 states and 14016 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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) [2024-11-09 05:55:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:38,009 INFO L93 Difference]: Finished difference Result 5986 states and 20230 transitions. [2024-11-09 05:55:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:55:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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 [2024-11-09 05:55:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:38,146 INFO L225 Difference]: With dead ends: 5986 [2024-11-09 05:55:38,146 INFO L226 Difference]: Without dead ends: 2850 [2024-11-09 05:55:38,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:55:38,154 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:38,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 30 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2024-11-09 05:55:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2850. [2024-11-09 05:55:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2849 states have (on average 3.2348192348192346) internal successors, (9216), 2849 states have internal predecessors, (9216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 9216 transitions. [2024-11-09 05:55:38,412 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 9216 transitions. Word has length 15 [2024-11-09 05:55:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:38,412 INFO L471 AbstractCegarLoop]: Abstraction has 2850 states and 9216 transitions. [2024-11-09 05:55:38,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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) [2024-11-09 05:55:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 9216 transitions. [2024-11-09 05:55:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:55:38,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:38,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:55:38,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -879549689, now seen corresponding path program 1 times [2024-11-09 05:55:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040511727] [2024-11-09 05:55:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:38,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:38,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040511727] [2024-11-09 05:55:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040511727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:38,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:38,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:55:38,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405533942] [2024-11-09 05:55:38,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:38,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:55:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:38,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:55:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:55:38,978 INFO L87 Difference]: Start difference. First operand 2850 states and 9216 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:39,242 INFO L93 Difference]: Finished difference Result 3426 states and 10840 transitions. [2024-11-09 05:55:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:39,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 05:55:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:39,364 INFO L225 Difference]: With dead ends: 3426 [2024-11-09 05:55:39,364 INFO L226 Difference]: Without dead ends: 1490 [2024-11-09 05:55:39,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:55:39,368 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 108 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:39,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 37 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-09 05:55:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2024-11-09 05:55:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1489 states have (on average 2.992612491605104) internal successors, (4456), 1489 states have internal predecessors, (4456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4456 transitions. [2024-11-09 05:55:39,580 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4456 transitions. Word has length 20 [2024-11-09 05:55:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:39,580 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 4456 transitions. [2024-11-09 05:55:39,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4456 transitions. [2024-11-09 05:55:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:55:39,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:39,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:39,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:55:39,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:39,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1937390260, now seen corresponding path program 1 times [2024-11-09 05:55:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094290827] [2024-11-09 05:55:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:40,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094290827] [2024-11-09 05:55:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094290827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:40,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:40,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:55:40,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707144057] [2024-11-09 05:55:40,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:40,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:55:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:40,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:55:40,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:55:40,292 INFO L87 Difference]: Start difference. First operand 1490 states and 4456 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:40,800 INFO L93 Difference]: Finished difference Result 1554 states and 4608 transitions. [2024-11-09 05:55:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:55:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-09 05:55:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:40,937 INFO L225 Difference]: With dead ends: 1554 [2024-11-09 05:55:40,937 INFO L226 Difference]: Without dead ends: 978 [2024-11-09 05:55:40,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:55:40,940 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 145 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:40,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 27 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-09 05:55:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2024-11-09 05:55:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 2.9887410440122824) internal successors, (2920), 977 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2920 transitions. [2024-11-09 05:55:41,099 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2920 transitions. Word has length 25 [2024-11-09 05:55:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:41,100 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 2920 transitions. [2024-11-09 05:55:41,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2920 transitions. [2024-11-09 05:55:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:55:41,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:41,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:41,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:55:41,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:41,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1179272195, now seen corresponding path program 1 times [2024-11-09 05:55:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349080717] [2024-11-09 05:55:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:55:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:55:41,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:55:41,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349080717] [2024-11-09 05:55:41,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349080717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:55:41,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:55:41,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:55:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764068132] [2024-11-09 05:55:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:55:41,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:55:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:55:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:55:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:55:41,778 INFO L87 Difference]: Start difference. First operand 978 states and 2920 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:55:41,984 INFO L93 Difference]: Finished difference Result 1378 states and 4068 transitions. [2024-11-09 05:55:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:55:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:55:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:55:42,126 INFO L225 Difference]: With dead ends: 1378 [2024-11-09 05:55:42,127 INFO L226 Difference]: Without dead ends: 630 [2024-11-09 05:55:42,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:55:42,131 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:55:42,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:55:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-09 05:55:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-09 05:55:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 2.87758346581876) internal successors, (1810), 629 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1810 transitions. [2024-11-09 05:55:42,284 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1810 transitions. Word has length 31 [2024-11-09 05:55:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:55:42,284 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 1810 transitions. [2024-11-09 05:55:42,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:55:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1810 transitions. [2024-11-09 05:55:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:55:42,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:55:42,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:42,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 05:55:42,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:55:42,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:55:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -702842965, now seen corresponding path program 2 times [2024-11-09 05:55:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:55:42,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169656152] [2024-11-09 05:55:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:55:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:55:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:55:42,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:55:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:55:42,777 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:55:42,777 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:55:42,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (102 of 103 remaining) [2024-11-09 05:55:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2024-11-09 05:55:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2024-11-09 05:55:42,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2024-11-09 05:55:42,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2024-11-09 05:55:42,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2024-11-09 05:55:42,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2024-11-09 05:55:42,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2024-11-09 05:55:42,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2024-11-09 05:55:42,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2024-11-09 05:55:42,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2024-11-09 05:55:42,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 103 remaining) [2024-11-09 05:55:42,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2024-11-09 05:55:42,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2024-11-09 05:55:42,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2024-11-09 05:55:42,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2024-11-09 05:55:42,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2024-11-09 05:55:42,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2024-11-09 05:55:42,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2024-11-09 05:55:42,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2024-11-09 05:55:42,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 103 remaining) [2024-11-09 05:55:42,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 103 remaining) [2024-11-09 05:55:42,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2024-11-09 05:55:42,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2024-11-09 05:55:42,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2024-11-09 05:55:42,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2024-11-09 05:55:42,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2024-11-09 05:55:42,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2024-11-09 05:55:42,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2024-11-09 05:55:42,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2024-11-09 05:55:42,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2024-11-09 05:55:42,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2024-11-09 05:55:42,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2024-11-09 05:55:42,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2024-11-09 05:55:42,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2024-11-09 05:55:42,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2024-11-09 05:55:42,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2024-11-09 05:55:42,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2024-11-09 05:55:42,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2024-11-09 05:55:42,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2024-11-09 05:55:42,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2024-11-09 05:55:42,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2024-11-09 05:55:42,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2024-11-09 05:55:42,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2024-11-09 05:55:42,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2024-11-09 05:55:42,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (43 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2024-11-09 05:55:42,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2024-11-09 05:55:42,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2024-11-09 05:55:42,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2024-11-09 05:55:42,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2024-11-09 05:55:42,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2024-11-09 05:55:42,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2024-11-09 05:55:42,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2024-11-09 05:55:42,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2024-11-09 05:55:42,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2024-11-09 05:55:42,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2024-11-09 05:55:42,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2024-11-09 05:55:42,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2024-11-09 05:55:42,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2024-11-09 05:55:42,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2024-11-09 05:55:42,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2024-11-09 05:55:42,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2024-11-09 05:55:42,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2024-11-09 05:55:42,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2024-11-09 05:55:42,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2024-11-09 05:55:42,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2024-11-09 05:55:42,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2024-11-09 05:55:42,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2024-11-09 05:55:42,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2024-11-09 05:55:42,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2024-11-09 05:55:42,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2024-11-09 05:55:42,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2024-11-09 05:55:42,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2024-11-09 05:55:42,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2024-11-09 05:55:42,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2024-11-09 05:55:42,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2024-11-09 05:55:42,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2024-11-09 05:55:42,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2024-11-09 05:55:42,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2024-11-09 05:55:42,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2024-11-09 05:55:42,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2024-11-09 05:55:42,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2024-11-09 05:55:42,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2024-11-09 05:55:42,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 103 remaining) [2024-11-09 05:55:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:55:42,806 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:55:42,903 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 05:55:42,904 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:55:42,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:55:42 BasicIcfg [2024-11-09 05:55:42,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:55:42,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:55:42,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:55:42,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:55:42,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:12" (3/4) ... [2024-11-09 05:55:42,913 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:55:42,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:55:42,915 INFO L158 Benchmark]: Toolchain (without parser) took 33187.26ms. Allocated memory was 117.4MB in the beginning and 14.0GB in the end (delta: 13.9GB). Free memory was 50.9MB in the beginning and 11.9GB in the end (delta: -11.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-09 05:55:42,915 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:55:42,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.44ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 50.7MB in the beginning and 94.9MB in the end (delta: -44.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-09 05:55:42,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.11ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:55:42,916 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:55:42,916 INFO L158 Benchmark]: RCFGBuilder took 2119.09ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 89.2MB in the beginning and 111.2MB in the end (delta: -21.9MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2024-11-09 05:55:42,917 INFO L158 Benchmark]: TraceAbstraction took 30174.23ms. Allocated memory was 172.0MB in the beginning and 14.0GB in the end (delta: 13.8GB). Free memory was 110.1MB in the beginning and 11.9GB in the end (delta: -11.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-09 05:55:42,917 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 14.0GB. Free memory is still 11.9GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:55:42,919 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.44ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 50.7MB in the beginning and 94.9MB in the end (delta: -44.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.11ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 92.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2119.09ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 89.2MB in the beginning and 111.2MB in the end (delta: -21.9MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30174.23ms. Allocated memory was 172.0MB in the beginning and 14.0GB in the end (delta: 13.8GB). Free memory was 110.1MB in the beginning and 11.9GB in the end (delta: -11.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 14.0GB. Free memory is still 11.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [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; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2124=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L855] 0 pthread_t t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2124=-3, t2125=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2124=-3, t2125=-2, t2126=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] 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)))) [L814] EXPR 3 \read(x) [L814] 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)))) [L814] 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)))) [L815] 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)))) [L816] 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)))) [L817] 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)))) [L818] 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)))) [L819] 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)))) [L820] 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)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=0] [L828] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L831] 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) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L759] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3: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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L789] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L792] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L795] 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) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] 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) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2124=-3, t2125=-2, t2126=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2124=-3, t2125=-2, t2126=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(x) [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 \read(x) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 \read(x) [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] EXPR 0 \read(x) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2124=-3, t2125=-2, t2126=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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, x={3:0}, y=2] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "safe015_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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, x={3: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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 29.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 157 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267906occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 [2024-11-09 05:55:42,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:55:45,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:55:45,618 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 05:55:45,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:55:45,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:55:45,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:55:45,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:55:45,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:55:45,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:55:45,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:55:45,674 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:55:45,674 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:55:45,675 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:55:45,675 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:55:45,675 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:55:45,677 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:55:45,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:55:45,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:55:45,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:55:45,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:55:45,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:55:45,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:55:45,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:55:45,685 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:55:45,685 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:55:45,686 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:55:45,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:55:45,686 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:55:45,686 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:55:45,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:55:45,687 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:55:45,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:55:45,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:55:45,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:55:45,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:55:45,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:55:45,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:55:45,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:55:45,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:55:45,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:55:45,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:55:45,692 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:55:45,692 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:55:45,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:55:45,700 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:55:45,700 INFO L153 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_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/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_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 7ed03bf56a68b0ba240fc33c794b8871860875fa75320178f23c03b98fa54cab [2024-11-09 05:55:46,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:55:46,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:55:46,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:55:46,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:55:46,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:55:46,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/pthread-wmm/safe015_power.opt.i Unable to find full path for "g++" [2024-11-09 05:55:48,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:55:48,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:55:48,526 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/sv-benchmarks/c/pthread-wmm/safe015_power.opt.i [2024-11-09 05:55:48,545 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data/75d1a43e7/8d9a3e552eee4ff987620b5544703559/FLAG231b82c41 [2024-11-09 05:55:48,726 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/data/75d1a43e7/8d9a3e552eee4ff987620b5544703559 [2024-11-09 05:55:48,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:55:48,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:55:48,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:55:48,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:55:48,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:55:48,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:55:48" (1/1) ... [2024-11-09 05:55:48,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6320d039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:48, skipping insertion in model container [2024-11-09 05:55:48,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:55:48" (1/1) ... [2024-11-09 05:55:48,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:55:49,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:55:49,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:55:49,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:55:49,547 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:55:49,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49 WrapperNode [2024-11-09 05:55:49,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:55:49,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:55:49,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:55:49,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:55:49,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,613 INFO L138 Inliner]: procedures = 179, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2024-11-09 05:55:49,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:55:49,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:55:49,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:55:49,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:55:49,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:55:49,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:55:49,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:55:49,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:55:49,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (1/1) ... [2024-11-09 05:55:49,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:55:49,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:55:49,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:55:49,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:55:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 05:55:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 05:55:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:55:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:55:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 05:55:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-09 05:55:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 05:55:49,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 05:55:49,783 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 05:55:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 05:55:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 05:55:49,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 05:55:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 05:55:49,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:55:49,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:55:49,787 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 05:55:49,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:55:49,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:55:50,930 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 05:55:50,930 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:55:52,172 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:55:52,172 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:55:52,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:52 BoogieIcfgContainer [2024-11-09 05:55:52,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:55:52,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:55:52,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:55:52,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:55:52,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:55:48" (1/3) ... [2024-11-09 05:55:52,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7f9459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:55:52, skipping insertion in model container [2024-11-09 05:55:52,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:55:49" (2/3) ... [2024-11-09 05:55:52,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7f9459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:55:52, skipping insertion in model container [2024-11-09 05:55:52,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:52" (3/3) ... [2024-11-09 05:55:52,185 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2024-11-09 05:55:52,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:55:52,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-11-09 05:55:52,206 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 05:55:52,490 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 05:55:52,529 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 102 transitions, 216 flow [2024-11-09 05:56:01,153 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 267906 states, 216310 states have (on average 4.798118441126162) internal successors, (1037881), 267905 states have internal predecessors, (1037881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:01,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:56:01,204 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4bc559e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:56:01,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2024-11-09 05:56:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 267906 states, 216310 states have (on average 4.798118441126162) internal successors, (1037881), 267905 states have internal predecessors, (1037881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:56:01,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:01,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:56:01,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:01,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash 997383666, now seen corresponding path program 1 times [2024-11-09 05:56:01,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:01,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465847708] [2024-11-09 05:56:01,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:01,782 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 [2024-11-09 05:56:01,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:01,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:01,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:02,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:56:02,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:02,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:02,099 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465847708] [2024-11-09 05:56:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465847708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:02,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:56:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539576005] [2024-11-09 05:56:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:56:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:02,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:56:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:56:02,507 INFO L87 Difference]: Start difference. First operand has 267906 states, 216310 states have (on average 4.798118441126162) internal successors, (1037881), 267905 states have internal predecessors, (1037881), 0 states have call successors, (0), 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 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) [2024-11-09 05:56:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:08,287 INFO L93 Difference]: Finished difference Result 271830 states and 1064403 transitions. [2024-11-09 05:56:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:56:08,290 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 [2024-11-09 05:56:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:08,912 INFO L225 Difference]: With dead ends: 271830 [2024-11-09 05:56:08,913 INFO L226 Difference]: Without dead ends: 18992 [2024-11-09 05:56:09,309 INFO L431 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 [2024-11-09 05:56:09,313 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:09,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:56:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18992 states. [2024-11-09 05:56:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18992 to 18992. [2024-11-09 05:56:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18992 states, 18673 states have (on average 3.695978150270444) internal successors, (69015), 18991 states have internal predecessors, (69015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18992 states to 18992 states and 69015 transitions. [2024-11-09 05:56:11,217 INFO L78 Accepts]: Start accepts. Automaton has 18992 states and 69015 transitions. Word has length 6 [2024-11-09 05:56:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:11,218 INFO L471 AbstractCegarLoop]: Abstraction has 18992 states and 69015 transitions. [2024-11-09 05:56:11,218 INFO L472 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) [2024-11-09 05:56:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18992 states and 69015 transitions. [2024-11-09 05:56:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:56:11,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:11,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:56:11,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 05:56:11,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:11,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:11,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash 997383667, now seen corresponding path program 1 times [2024-11-09 05:56:11,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540058440] [2024-11-09 05:56:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:11,423 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 [2024-11-09 05:56:11,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:11,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:11,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:11,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:56:11,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:11,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:11,692 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540058440] [2024-11-09 05:56:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540058440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:56:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471944805] [2024-11-09 05:56:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:11,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:56:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:56:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:56:11,696 INFO L87 Difference]: Start difference. First operand 18992 states and 69015 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) [2024-11-09 05:56:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:11,944 INFO L93 Difference]: Finished difference Result 18992 states and 69015 transitions. [2024-11-09 05:56:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:56:11,945 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 [2024-11-09 05:56:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:12,106 INFO L225 Difference]: With dead ends: 18992 [2024-11-09 05:56:12,106 INFO L226 Difference]: Without dead ends: 6010 [2024-11-09 05:56:12,132 INFO L431 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 [2024-11-09 05:56:12,133 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:12,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:56:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2024-11-09 05:56:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 6010. [2024-11-09 05:56:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 6006 states have (on average 3.504995004995005) internal successors, (21051), 6009 states have internal predecessors, (21051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 21051 transitions. [2024-11-09 05:56:12,453 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 21051 transitions. Word has length 6 [2024-11-09 05:56:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:12,454 INFO L471 AbstractCegarLoop]: Abstraction has 6010 states and 21051 transitions. [2024-11-09 05:56:12,454 INFO L472 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) [2024-11-09 05:56:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 21051 transitions. [2024-11-09 05:56:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:56:12,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:12,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:12,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:56:12,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:12,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:12,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash 454524599, now seen corresponding path program 1 times [2024-11-09 05:56:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282159725] [2024-11-09 05:56:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:12,659 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 [2024-11-09 05:56:12,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:12,662 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:12,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:12,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:56:12,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:12,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:12,905 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282159725] [2024-11-09 05:56:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282159725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:56:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667985872] [2024-11-09 05:56:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:12,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:56:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:56:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:56:12,908 INFO L87 Difference]: Start difference. First operand 6010 states and 21051 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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) [2024-11-09 05:56:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:13,203 INFO L93 Difference]: Finished difference Result 9156 states and 31300 transitions. [2024-11-09 05:56:13,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:56:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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 [2024-11-09 05:56:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:13,340 INFO L225 Difference]: With dead ends: 9156 [2024-11-09 05:56:13,341 INFO L226 Difference]: Without dead ends: 4060 [2024-11-09 05:56:13,351 INFO L431 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 [2024-11-09 05:56:13,352 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 60 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:13,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:56:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2024-11-09 05:56:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 4060. [2024-11-09 05:56:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4056 states have (on average 3.2670118343195265) internal successors, (13251), 4059 states have internal predecessors, (13251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 13251 transitions. [2024-11-09 05:56:14,020 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 13251 transitions. Word has length 11 [2024-11-09 05:56:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 4060 states and 13251 transitions. [2024-11-09 05:56:14,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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) [2024-11-09 05:56:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 13251 transitions. [2024-11-09 05:56:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:56:14,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:14,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:14,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:14,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:14,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:14,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1372847324, now seen corresponding path program 1 times [2024-11-09 05:56:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112874876] [2024-11-09 05:56:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:14,230 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 [2024-11-09 05:56:14,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:14,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:14,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:14,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:56:14,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:14,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:14,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112874876] [2024-11-09 05:56:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112874876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:56:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269695347] [2024-11-09 05:56:14,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:56:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:14,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:56:14,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:56:14,519 INFO L87 Difference]: Start difference. First operand 4060 states and 13251 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:14,838 INFO L93 Difference]: Finished difference Result 4996 states and 15935 transitions. [2024-11-09 05:56:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:56:14,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:56:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:14,961 INFO L225 Difference]: With dead ends: 4996 [2024-11-09 05:56:14,961 INFO L226 Difference]: Without dead ends: 1850 [2024-11-09 05:56:14,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:56:14,968 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 99 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:14,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 54 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:56:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-11-09 05:56:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2024-11-09 05:56:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1846 states have (on average 2.988082340195016) internal successors, (5516), 1849 states have internal predecessors, (5516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 5516 transitions. [2024-11-09 05:56:15,133 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 5516 transitions. Word has length 16 [2024-11-09 05:56:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 5516 transitions. [2024-11-09 05:56:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 5516 transitions. [2024-11-09 05:56:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:56:15,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:15,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:15,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 05:56:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:15,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2048089829, now seen corresponding path program 1 times [2024-11-09 05:56:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784279160] [2024-11-09 05:56:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:15,339 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 [2024-11-09 05:56:15,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:15,344 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:15,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:15,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:56:15,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:15,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:15,654 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784279160] [2024-11-09 05:56:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784279160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:15,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:56:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537458360] [2024-11-09 05:56:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:15,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:56:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:56:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:56:15,656 INFO L87 Difference]: Start difference. First operand 1850 states and 5516 transitions. Second operand has 6 states, 6 states have (on average 3.5) 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) [2024-11-09 05:56:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:16,030 INFO L93 Difference]: Finished difference Result 1954 states and 5768 transitions. [2024-11-09 05:56:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:56:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) 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 [2024-11-09 05:56:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:16,138 INFO L225 Difference]: With dead ends: 1954 [2024-11-09 05:56:16,138 INFO L226 Difference]: Without dead ends: 1018 [2024-11-09 05:56:16,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:56:16,141 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 118 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:16,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 83 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:56:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-09 05:56:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2024-11-09 05:56:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1014 states have (on average 2.978303747534517) internal successors, (3020), 1017 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3020 transitions. [2024-11-09 05:56:16,303 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3020 transitions. Word has length 21 [2024-11-09 05:56:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:16,304 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 3020 transitions. [2024-11-09 05:56:16,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) 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) [2024-11-09 05:56:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3020 transitions. [2024-11-09 05:56:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:56:16,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:16,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:16,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 05:56:16,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:16,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash 123487972, now seen corresponding path program 1 times [2024-11-09 05:56:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561231822] [2024-11-09 05:56:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:16,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:16,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:16,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:16,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:56:16,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:17,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:17,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561231822] [2024-11-09 05:56:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561231822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:56:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271553751] [2024-11-09 05:56:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:56:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:56:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:56:17,016 INFO L87 Difference]: Start difference. First operand 1018 states and 3020 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:17,160 INFO L93 Difference]: Finished difference Result 1018 states and 3020 transitions. [2024-11-09 05:56:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:56:17,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 05:56:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:17,275 INFO L225 Difference]: With dead ends: 1018 [2024-11-09 05:56:17,275 INFO L226 Difference]: Without dead ends: 1010 [2024-11-09 05:56:17,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:56:17,276 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 29 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 [2024-11-09 05:56:17,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 29 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:56:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-09 05:56:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2024-11-09 05:56:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1007 states have (on average 2.9791459781529297) internal successors, (3000), 1009 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 3000 transitions. [2024-11-09 05:56:17,425 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 3000 transitions. Word has length 27 [2024-11-09 05:56:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:17,426 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 3000 transitions. [2024-11-09 05:56:17,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 3000 transitions. [2024-11-09 05:56:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:56:17,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:17,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:17,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 05:56:17,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:17,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash 123487973, now seen corresponding path program 1 times [2024-11-09 05:56:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957812062] [2024-11-09 05:56:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:17,632 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 [2024-11-09 05:56:17,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:17,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:17,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:17,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:56:17,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:18,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:18,159 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:18,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957812062] [2024-11-09 05:56:18,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957812062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:18,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:18,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:56:18,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969966733] [2024-11-09 05:56:18,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:18,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:56:18,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:18,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:56:18,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:56:18,162 INFO L87 Difference]: Start difference. First operand 1010 states and 3000 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:18,288 INFO L93 Difference]: Finished difference Result 1010 states and 3000 transitions. [2024-11-09 05:56:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:56:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 05:56:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:18,420 INFO L225 Difference]: With dead ends: 1010 [2024-11-09 05:56:18,421 INFO L226 Difference]: Without dead ends: 1002 [2024-11-09 05:56:18,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:56:18,422 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:18,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:56:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2024-11-09 05:56:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2024-11-09 05:56:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 1000 states have (on average 2.98) internal successors, (2980), 1001 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 2980 transitions. [2024-11-09 05:56:18,554 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 2980 transitions. Word has length 27 [2024-11-09 05:56:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:18,554 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 2980 transitions. [2024-11-09 05:56:18,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2980 transitions. [2024-11-09 05:56:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:18,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:18,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:18,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:18,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:18,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash -490577772, now seen corresponding path program 1 times [2024-11-09 05:56:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199532730] [2024-11-09 05:56:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:18,759 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 [2024-11-09 05:56:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:18,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:18,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:19,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:56:19,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:19,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:19,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:19,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199532730] [2024-11-09 05:56:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199532730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:19,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 05:56:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107302377] [2024-11-09 05:56:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:19,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:56:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:19,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:56:19,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:56:19,312 INFO L87 Difference]: Start difference. First operand 1002 states and 2980 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:19,383 INFO L93 Difference]: Finished difference Result 1002 states and 2980 transitions. [2024-11-09 05:56:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:56:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:56:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:19,490 INFO L225 Difference]: With dead ends: 1002 [2024-11-09 05:56:19,490 INFO L226 Difference]: Without dead ends: 978 [2024-11-09 05:56:19,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:56:19,492 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:19,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:56:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-09 05:56:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2024-11-09 05:56:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 2.9887410440122824) internal successors, (2920), 977 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2920 transitions. [2024-11-09 05:56:19,639 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2920 transitions. Word has length 31 [2024-11-09 05:56:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 2920 transitions. [2024-11-09 05:56:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2920 transitions. [2024-11-09 05:56:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:19,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:19,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:19,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 05:56:19,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:19,845 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:19,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash -490576625, now seen corresponding path program 1 times [2024-11-09 05:56:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:19,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009592144] [2024-11-09 05:56:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:56:19,846 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 [2024-11-09 05:56:19,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:19,847 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:19,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:56:20,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:56:20,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:20,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:20,155 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:20,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009592144] [2024-11-09 05:56:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009592144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:20,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:20,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:56:20,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620964360] [2024-11-09 05:56:20,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:20,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:56:20,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:20,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:56:20,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:56:20,158 INFO L87 Difference]: Start difference. First operand 978 states and 2920 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:20,385 INFO L93 Difference]: Finished difference Result 1378 states and 4068 transitions. [2024-11-09 05:56:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:56:20,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:56:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:20,492 INFO L225 Difference]: With dead ends: 1378 [2024-11-09 05:56:20,492 INFO L226 Difference]: Without dead ends: 630 [2024-11-09 05:56:20,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:56:20,495 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:20,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 71 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:56:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-09 05:56:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2024-11-09 05:56:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 2.87758346581876) internal successors, (1810), 629 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1810 transitions. [2024-11-09 05:56:20,628 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1810 transitions. Word has length 31 [2024-11-09 05:56:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:20,629 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 1810 transitions. [2024-11-09 05:56:20,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1810 transitions. [2024-11-09 05:56:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:20,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:20,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:20,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:20,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:20,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1724653197, now seen corresponding path program 2 times [2024-11-09 05:56:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:20,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186400951] [2024-11-09 05:56:20,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:56:20,834 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 [2024-11-09 05:56:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:20,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:20,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:21,091 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 05:56:21,091 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:56:21,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 05:56:21,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:21,494 INFO L378 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 51 treesize of output 28 [2024-11-09 05:56:21,741 INFO L378 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 [2024-11-09 05:56:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:21,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:21,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186400951] [2024-11-09 05:56:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186400951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:21,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:21,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:56:21,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429070234] [2024-11-09 05:56:21,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:21,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:56:21,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:56:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:56:21,849 INFO L87 Difference]: Start difference. First operand 630 states and 1810 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:22,284 INFO L93 Difference]: Finished difference Result 902 states and 2558 transitions. [2024-11-09 05:56:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:56:22,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:56:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:22,392 INFO L225 Difference]: With dead ends: 902 [2024-11-09 05:56:22,393 INFO L226 Difference]: Without dead ends: 694 [2024-11-09 05:56:22,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:56:22,394 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:22,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 58 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:56:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-09 05:56:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 558. [2024-11-09 05:56:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.797127468581688) internal successors, (1558), 557 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1558 transitions. [2024-11-09 05:56:22,587 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1558 transitions. Word has length 31 [2024-11-09 05:56:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:22,588 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 1558 transitions. [2024-11-09 05:56:22,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1558 transitions. [2024-11-09 05:56:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:22,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:22,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:22,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:22,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:22,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:22,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash -594391787, now seen corresponding path program 3 times [2024-11-09 05:56:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325300887] [2024-11-09 05:56:22,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:56:22,795 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 [2024-11-09 05:56:22,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:22,801 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:22,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:23,053 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 05:56:23,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:56:23,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:56:23,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:23,239 INFO L378 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 [2024-11-09 05:56:23,322 INFO L378 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 19 treesize of output 11 [2024-11-09 05:56:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:23,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:23,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325300887] [2024-11-09 05:56:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325300887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:23,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:56:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467807772] [2024-11-09 05:56:23,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:23,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:56:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:56:23,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:56:23,591 INFO L87 Difference]: Start difference. First operand 558 states and 1558 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:24,185 INFO L93 Difference]: Finished difference Result 1078 states and 2950 transitions. [2024-11-09 05:56:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:56:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:56:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:24,327 INFO L225 Difference]: With dead ends: 1078 [2024-11-09 05:56:24,327 INFO L226 Difference]: Without dead ends: 714 [2024-11-09 05:56:24,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:56:24,329 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 84 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:24,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 131 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:56:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-11-09 05:56:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 570. [2024-11-09 05:56:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 2.741652021089631) internal successors, (1560), 569 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1560 transitions. [2024-11-09 05:56:24,540 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1560 transitions. Word has length 31 [2024-11-09 05:56:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:24,540 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 1560 transitions. [2024-11-09 05:56:24,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1560 transitions. [2024-11-09 05:56:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:24,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:24,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:24,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 05:56:24,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:24,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1061603251, now seen corresponding path program 4 times [2024-11-09 05:56:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571798126] [2024-11-09 05:56:24,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:56:24,744 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 [2024-11-09 05:56:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:24,746 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:24,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:25,298 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:56:25,298 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:56:25,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:56:25,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:25,956 INFO L378 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 [2024-11-09 05:56:26,234 INFO L378 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 3 [2024-11-09 05:56:26,841 INFO L378 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 78 treesize of output 47 [2024-11-09 05:56:27,146 INFO L378 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 45 [2024-11-09 05:56:27,839 INFO L378 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 100 treesize of output 69 [2024-11-09 05:56:28,023 INFO L378 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 66 treesize of output 50 [2024-11-09 05:56:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:28,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:28,077 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:28,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571798126] [2024-11-09 05:56:28,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571798126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:28,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:28,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:56:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658812207] [2024-11-09 05:56:28,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:28,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:56:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:56:28,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:56:28,080 INFO L87 Difference]: Start difference. First operand 570 states and 1560 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:29,354 INFO L93 Difference]: Finished difference Result 914 states and 2518 transitions. [2024-11-09 05:56:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:56:29,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:56:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:29,450 INFO L225 Difference]: With dead ends: 914 [2024-11-09 05:56:29,450 INFO L226 Difference]: Without dead ends: 542 [2024-11-09 05:56:29,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:56:29,451 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 177 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:29,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 180 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:56:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-09 05:56:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 438. [2024-11-09 05:56:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.7688787185354693) internal successors, (1210), 437 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1210 transitions. [2024-11-09 05:56:29,601 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1210 transitions. Word has length 31 [2024-11-09 05:56:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:29,602 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 1210 transitions. [2024-11-09 05:56:29,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1210 transitions. [2024-11-09 05:56:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:29,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:29,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:29,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:29,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:29,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:29,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 359423359, now seen corresponding path program 5 times [2024-11-09 05:56:29,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:29,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889024996] [2024-11-09 05:56:29,805 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 05:56:29,806 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 [2024-11-09 05:56:29,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:29,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:29,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:30,047 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 05:56:30,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:56:30,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:56:30,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:56:30,359 INFO L378 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 [2024-11-09 05:56:30,424 INFO L378 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 19 treesize of output 11 [2024-11-09 05:56:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:56:30,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:56:30,613 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:56:30,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889024996] [2024-11-09 05:56:30,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889024996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:56:30,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:56:30,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:56:30,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070977838] [2024-11-09 05:56:30,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:56:30,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:56:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:56:30,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:56:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:56:30,615 INFO L87 Difference]: Start difference. First operand 438 states and 1210 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:56:31,202 INFO L93 Difference]: Finished difference Result 662 states and 1818 transitions. [2024-11-09 05:56:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:56:31,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 05:56:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:56:31,302 INFO L225 Difference]: With dead ends: 662 [2024-11-09 05:56:31,302 INFO L226 Difference]: Without dead ends: 390 [2024-11-09 05:56:31,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:56:31,303 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:56:31,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 119 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:56:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-09 05:56:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-09 05:56:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.7249357326478147) internal successors, (1060), 389 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1060 transitions. [2024-11-09 05:56:31,412 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1060 transitions. Word has length 31 [2024-11-09 05:56:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:56:31,413 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 1060 transitions. [2024-11-09 05:56:31,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:56:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1060 transitions. [2024-11-09 05:56:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:56:31,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:56:31,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:31,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:31,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:31,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 100 more)] === [2024-11-09 05:56:31,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:56:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 356886387, now seen corresponding path program 6 times [2024-11-09 05:56:31,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:56:31,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705317672] [2024-11-09 05:56:31,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 05:56:31,616 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 [2024-11-09 05:56:31,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:56:31,617 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 05:56:31,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 05:56:31,886 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-09 05:56:31,886 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 05:56:31,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:56:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:56:32,189 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-09 05:56:32,189 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:56:32,190 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (102 of 103 remaining) [2024-11-09 05:56:32,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 103 remaining) [2024-11-09 05:56:32,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 103 remaining) [2024-11-09 05:56:32,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 103 remaining) [2024-11-09 05:56:32,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 103 remaining) [2024-11-09 05:56:32,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 103 remaining) [2024-11-09 05:56:32,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 103 remaining) [2024-11-09 05:56:32,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 103 remaining) [2024-11-09 05:56:32,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 103 remaining) [2024-11-09 05:56:32,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 103 remaining) [2024-11-09 05:56:32,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 103 remaining) [2024-11-09 05:56:32,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 103 remaining) [2024-11-09 05:56:32,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 103 remaining) [2024-11-09 05:56:32,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 103 remaining) [2024-11-09 05:56:32,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 103 remaining) [2024-11-09 05:56:32,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 103 remaining) [2024-11-09 05:56:32,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 103 remaining) [2024-11-09 05:56:32,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 103 remaining) [2024-11-09 05:56:32,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 103 remaining) [2024-11-09 05:56:32,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 103 remaining) [2024-11-09 05:56:32,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 103 remaining) [2024-11-09 05:56:32,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 103 remaining) [2024-11-09 05:56:32,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 103 remaining) [2024-11-09 05:56:32,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 103 remaining) [2024-11-09 05:56:32,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 103 remaining) [2024-11-09 05:56:32,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 103 remaining) [2024-11-09 05:56:32,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 103 remaining) [2024-11-09 05:56:32,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 103 remaining) [2024-11-09 05:56:32,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 103 remaining) [2024-11-09 05:56:32,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 103 remaining) [2024-11-09 05:56:32,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 103 remaining) [2024-11-09 05:56:32,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 103 remaining) [2024-11-09 05:56:32,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 103 remaining) [2024-11-09 05:56:32,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 103 remaining) [2024-11-09 05:56:32,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 103 remaining) [2024-11-09 05:56:32,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 103 remaining) [2024-11-09 05:56:32,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 103 remaining) [2024-11-09 05:56:32,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 103 remaining) [2024-11-09 05:56:32,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (43 of 103 remaining) [2024-11-09 05:56:32,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 103 remaining) [2024-11-09 05:56:32,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 103 remaining) [2024-11-09 05:56:32,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 103 remaining) [2024-11-09 05:56:32,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 103 remaining) [2024-11-09 05:56:32,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 103 remaining) [2024-11-09 05:56:32,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 103 remaining) [2024-11-09 05:56:32,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 103 remaining) [2024-11-09 05:56:32,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 103 remaining) [2024-11-09 05:56:32,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 103 remaining) [2024-11-09 05:56:32,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 103 remaining) [2024-11-09 05:56:32,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 103 remaining) [2024-11-09 05:56:32,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 103 remaining) [2024-11-09 05:56:32,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 103 remaining) [2024-11-09 05:56:32,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 103 remaining) [2024-11-09 05:56:32,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 103 remaining) [2024-11-09 05:56:32,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 103 remaining) [2024-11-09 05:56:32,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 103 remaining) [2024-11-09 05:56:32,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 103 remaining) [2024-11-09 05:56:32,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 103 remaining) [2024-11-09 05:56:32,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 103 remaining) [2024-11-09 05:56:32,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 103 remaining) [2024-11-09 05:56:32,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 103 remaining) [2024-11-09 05:56:32,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 103 remaining) [2024-11-09 05:56:32,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 103 remaining) [2024-11-09 05:56:32,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 103 remaining) [2024-11-09 05:56:32,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 103 remaining) [2024-11-09 05:56:32,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 103 remaining) [2024-11-09 05:56:32,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 103 remaining) [2024-11-09 05:56:32,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 103 remaining) [2024-11-09 05:56:32,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 103 remaining) [2024-11-09 05:56:32,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 103 remaining) [2024-11-09 05:56:32,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 103 remaining) [2024-11-09 05:56:32,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 103 remaining) [2024-11-09 05:56:32,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 103 remaining) [2024-11-09 05:56:32,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 103 remaining) [2024-11-09 05:56:32,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 103 remaining) [2024-11-09 05:56:32,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 103 remaining) [2024-11-09 05:56:32,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 05:56:32,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:56:32,412 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:56:32,504 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 05:56:32,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:56:32,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:56:32 BasicIcfg [2024-11-09 05:56:32,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:56:32,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:56:32,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:56:32,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:56:32,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:55:52" (3/4) ... [2024-11-09 05:56:32,511 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 05:56:32,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:56:32,512 INFO L158 Benchmark]: Toolchain (without parser) took 43781.96ms. Allocated memory was 73.4MB in the beginning and 13.7GB in the end (delta: 13.7GB). Free memory was 47.2MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-09 05:56:32,513 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 99.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:56:32,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.98ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 47.1MB in the beginning and 58.6MB in the end (delta: -11.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-09 05:56:32,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.94ms. Allocated memory is still 98.6MB. Free memory was 58.3MB in the beginning and 55.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:56:32,514 INFO L158 Benchmark]: Boogie Preprocessor took 76.19ms. Allocated memory is still 98.6MB. Free memory was 55.6MB in the beginning and 52.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:56:32,514 INFO L158 Benchmark]: RCFGBuilder took 2482.27ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 52.5MB in the beginning and 108.1MB in the end (delta: -55.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-09 05:56:32,515 INFO L158 Benchmark]: TraceAbstraction took 40332.48ms. Allocated memory was 144.7MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 108.1MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-09 05:56:32,515 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 13.7GB. Free memory is still 11.8GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:56:32,517 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 73.4MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 99.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.98ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 47.1MB in the beginning and 58.6MB in the end (delta: -11.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.94ms. Allocated memory is still 98.6MB. Free memory was 58.3MB in the beginning and 55.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.19ms. Allocated memory is still 98.6MB. Free memory was 55.6MB in the beginning and 52.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2482.27ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 52.5MB in the beginning and 108.1MB in the end (delta: -55.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40332.48ms. Allocated memory was 144.7MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 108.1MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 13.7GB. Free memory is still 11.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [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; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2124=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L855] 0 pthread_t t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2124=0, t2125=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2124=0, t2125=1, t2126=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] 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)))) [L814] EXPR 3 \read(x) [L814] 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)))) [L814] 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)))) [L815] 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)))) [L816] 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)))) [L817] 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)))) [L818] 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)))) [L819] 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)))) [L820] 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)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=0] [L828] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=1] [L831] 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) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=1] [L759] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3: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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=2] [L789] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=2] [L792] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=2] [L795] 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) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] 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) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=2] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=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$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, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2124=0, t2125=1, t2126=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2124=0, t2125=1, t2126=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(x) [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 0 \read(x) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 0 \read(x) [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2124=0, t2125=1, t2126=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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, x={3:0}, y=2] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "safe015_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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, x={3: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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 39.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.6s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 834 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1446 IncrementalHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 251 mSDtfsCounter, 1446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267906occurred in iteration=0, InterpolantAutomatonStates: 71, 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, 13 MinimizatonAttempts, 384 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 2920 SizeOfPredicates, 51 NumberOfNonLiveVariables, 2459 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 [2024-11-09 05:56:32,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44b974e1-e4a7-4d5d-a5a8-79d36edba782/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample